Base | Representation |
---|---|
bin | 10111001111100000000000… |
… | …101001001001001101101000 |
3 | 111101221011021202100000121202 |
4 | 113033200000221021031220 |
5 | 101344234014000233230 |
6 | 1001223154305023332 |
7 | 30350111436336065 |
oct | 2717400051111550 |
9 | 441834252300552 |
10 | 102220232430440 |
11 | 2a6303a2370653 |
12 | b56ab71024b48 |
13 | 45064325a46c7 |
14 | 1b356b288dc6c |
15 | bc3eb20a0a45 |
hex | 5cf800a49368 |
102220232430440 has 64 divisors (see below), whose sum is σ = 230271971126400. Its totient is φ = 40838953529088.
The previous prime is 102220232430427. The next prime is 102220232430493. The reversal of 102220232430440 is 44034232022201.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 510421607 + ... + 510621833.
It is an arithmetic number, because the mean of its divisors is an integer number (3597999548850).
Almost surely, 2102220232430440 is an apocalyptic number.
102220232430440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102220232430440 is an abundant number, since it is smaller than the sum of its proper divisors (128051738695960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102220232430440 is a wasteful number, since it uses less digits than its factorization.
102220232430440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 215514 (or 215510 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 29.
Adding to 102220232430440 its reverse (44034232022201), we get a palindrome (146254464452641).
The spelling of 102220232430440 in words is "one hundred two trillion, two hundred twenty billion, two hundred thirty-two million, four hundred thirty thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •