Base | Representation |
---|---|
bin | 101111100011011100… |
… | …1001010000100000000 |
3 | 100202120222220101212201 |
4 | 1133012321022010000 |
5 | 3133121001320000 |
6 | 114525214002544 |
7 | 10243441124554 |
oct | 1370671120400 |
9 | 322528811781 |
10 | 102121120000 |
11 | 3a344789a39 |
12 | 179601a6454 |
13 | 98260b3733 |
14 | 4d2aa47864 |
15 | 29ca57496a |
hex | 17c6e4a100 |
102121120000 has 180 divisors, whose sum is σ = 255360770896. Its totient is φ = 40746240000.
The previous prime is 102121119983. The next prime is 102121120009. The reversal of 102121120000 is 21121201.
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 (102121120009) 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, 125919595 + ... + 125920405.
Almost surely, 2102121120000 is an apocalyptic number.
102121120000 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 102121120000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (127680385448).
102121120000 is an abundant number, since it is smaller than the sum of its proper divisors (153239650896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102121120000 is an frugal number, since it uses more digits than its factorization.
102121120000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1634 (or 1605 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 102121120000 its reverse (21121201), we get a palindrome (102142241201).
The spelling of 102121120000 in words is "one hundred two billion, one hundred twenty-one million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •