Base | Representation |
---|---|
bin | 10111001100100101101000… |
… | …100011000011010100110100 |
3 | 111101020000202000211001100120 |
4 | 113030211220203003110310 |
5 | 101332444142210413022 |
6 | 1000551220442011540 |
7 | 30326465325424005 |
oct | 2714455043032464 |
9 | 441200660731316 |
10 | 102020112201012 |
11 | 2a563539751295 |
12 | b5382211a6bb0 |
13 | 44c05bc3ab075 |
14 | 1b29b2a8331ac |
15 | bbdb9d2ccd5c |
hex | 5cc9688c3534 |
102020112201012 has 24 divisors (see below), whose sum is σ = 238107300613056. Its totient is φ = 33998079475008.
The previous prime is 102020112201001. The next prime is 102020112201053. The reversal of 102020112201012 is 210102211020201.
It is a junction number, because it is equal to n+sod(n) for n = 102020112200982 and 102020112201000.
It is a congruent number.
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, 1078024713 + ... + 1078119344.
It is an arithmetic number, because the mean of its divisors is an integer number (9921137525544).
Almost surely, 2102020112201012 is an apocalyptic number.
102020112201012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102020112201012 is an abundant number, since it is smaller than the sum of its proper divisors (136087188412044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102020112201012 is a wasteful number, since it uses less digits than its factorization.
102020112201012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2156148007 (or 2156148005 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 102020112201012 its reverse (210102211020201), we get a palindrome (312122323221213).
The spelling of 102020112201012 in words is "one hundred two trillion, twenty billion, one hundred twelve million, two hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •