Base | Representation |
---|---|
bin | 101111100011000111… |
… | …1001100100001000000 |
3 | 100202120020012112201022 |
4 | 1133012033030201000 |
5 | 3133110142320000 |
6 | 114524142125012 |
7 | 10243245461600 |
oct | 1370617144100 |
9 | 322506175638 |
10 | 102110120000 |
11 | 3a339556529 |
12 | 17958580768 |
13 | 9823a31965 |
14 | 4d293c2c00 |
15 | 29c9600585 |
hex | 17c63cc840 |
102110120000 has 420 divisors, whose sum is σ = 299870073360. Its totient is φ = 34376832000.
The previous prime is 102110119997. The next prime is 102110120039. The reversal of 102110120000 is 21011201.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a self number, because there is not a number n which added to its sum of digits gives 102110120000.
It is an unprimeable number.
It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 115639559 + ... + 115640441.
Almost surely, 2102110120000 is an apocalyptic number.
102110120000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 102110120000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (149935036680).
102110120000 is an abundant number, since it is smaller than the sum of its proper divisors (197759953360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102110120000 is an frugal number, since it uses more digits than its factorization.
102110120000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 988 (or 956 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 102110120000 its reverse (21011201), we get a palindrome (102131131201).
The spelling of 102110120000 in words is "one hundred two billion, one hundred ten million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •