Base | Representation |
---|---|
bin | 10111001100100110100100… |
… | …000001110001011100110000 |
3 | 111101020010022120120002010201 |
4 | 113030212210001301130300 |
5 | 101333003213142010000 |
6 | 1000551503450404544 |
7 | 30326532133465444 |
oct | 2714464401613460 |
9 | 441203276502121 |
10 | 102021110110000 |
11 | 2a563a00a77064 |
12 | b53845b430754 |
13 | 44c071b065563 |
14 | 1b29bc3198824 |
15 | bbdc0abe996a |
hex | 5cc9a4071730 |
102021110110000 has 100 divisors (see below), whose sum is σ = 247536805391392. Its totient is φ = 40720303008000.
The previous prime is 102021110109977. The next prime is 102021110110001. The reversal of 102021110110000 is 11011120201.
It is a tau number, because it is divible by the number of its divisors (100).
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (102021110110001) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 6387399 + ... + 15647398.
Almost surely, 2102021110110000 is an apocalyptic number.
102021110110000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102021110110000 is an abundant number, since it is smaller than the sum of its proper divisors (145515695281392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102021110110000 is an equidigital number, since it uses as much as digits as its factorization.
102021110110000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22035288 (or 22035267 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 102021110110000 its reverse (11011120201), we get a palindrome (102032121230201).
The spelling of 102021110110000 in words is "one hundred two trillion, twenty-one billion, one hundred ten million, one hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •