Base | Representation |
---|---|
bin | 10111001110000011111010… |
… | …010000010010100100000000 |
3 | 111101120201000211200001110020 |
4 | 113032003322100102210000 |
5 | 101341124001244112112 |
6 | 1001105521342333440 |
7 | 30340011013152420 |
oct | 2716037220224400 |
9 | 441521024601406 |
10 | 102121341004032 |
11 | 2a5a2465776279 |
12 | b55397258a280 |
13 | 44ca00265818c |
14 | 1b309b0b60480 |
15 | bc162534248c |
hex | 5ce0fa412900 |
102121341004032 has 72 divisors (see below), whose sum is σ = 310619078903616. Its totient is φ = 29177525999616.
The previous prime is 102121341004013. The next prime is 102121341004043. The reversal of 102121341004032 is 230400143121201.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 102121341003993 and 102121341004011.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9497887203 + ... + 9497897954.
Almost surely, 2102121341004032 is an apocalyptic number.
102121341004032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102121341004032 is an abundant number, since it is smaller than the sum of its proper divisors (208497737899584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102121341004032 is an equidigital number, since it uses as much as digits as its factorization.
102121341004032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18995785183 (or 18995785169 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 102121341004032 its reverse (230400143121201), we get a palindrome (332521484125233).
The spelling of 102121341004032 in words is "one hundred two trillion, one hundred twenty-one billion, three hundred forty-one million, four thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •