Base | Representation |
---|---|
bin | 101111100001000010… |
… | …1010111011000101100 |
3 | 100202101101002010210111 |
4 | 1133002011113120230 |
5 | 3132434322343340 |
6 | 114513212345404 |
7 | 10241441244214 |
oct | 1370205273054 |
9 | 322341063714 |
10 | 102040434220 |
11 | 3a30318a57a |
12 | 17939175264 |
13 | 981247317a |
14 | 4d20043244 |
15 | 29c3437aea |
hex | 17c215762c |
102040434220 has 12 divisors (see below), whose sum is σ = 214284911904. Its totient is φ = 40816173680.
The previous prime is 102040434217. The next prime is 102040434247. The reversal of 102040434220 is 22434040201.
It is a happy number.
It is a super-2 number, since 2×1020404342202 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102040434191 and 102040434200.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2551010836 + ... + 2551010875.
It is an arithmetic number, because the mean of its divisors is an integer number (17857075992).
Almost surely, 2102040434220 is an apocalyptic number.
102040434220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102040434220 is an abundant number, since it is smaller than the sum of its proper divisors (112244477684).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102040434220 is a wasteful number, since it uses less digits than its factorization.
102040434220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5102021720 (or 5102021718 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 22.
Adding to 102040434220 its reverse (22434040201), we get a palindrome (124474474421).
The spelling of 102040434220 in words is "one hundred two billion, forty million, four hundred thirty-four thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •