Base | Representation |
---|---|
bin | 10111001101111011011111… |
… | …100011111000110011110000 |
3 | 111101112211200222111011020101 |
4 | 113031323133203320303300 |
5 | 101341001444111101000 |
6 | 1001101424451322144 |
7 | 30336241031241601 |
oct | 2715733743706360 |
9 | 441484628434211 |
10 | 102112303222000 |
11 | 2a599648119925 |
12 | b55206b8b0354 |
13 | 44c91c2109a66 |
14 | 1b30394711da8 |
15 | bc1296ba0e6a |
hex | 5cdedf8f8cf0 |
102112303222000 has 40 divisors (see below), whose sum is σ = 246907549195632. Its totient is φ = 40844921288000.
The previous prime is 102112303221989. The next prime is 102112303222031. The reversal of 102112303222000 is 222303211201.
It is a tau number, because it is divible by the number of its divisors (40).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25528073806 + ... + 25528077805.
Almost surely, 2102112303222000 is an apocalyptic number.
102112303222000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102112303222000 is an abundant number, since it is smaller than the sum of its proper divisors (144795245973632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102112303222000 is an equidigital number, since it uses as much as digits as its factorization.
102112303222000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51056151634 (or 51056151618 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 102112303222000 its reverse (222303211201), we get a palindrome (102334606433201).
The spelling of 102112303222000 in words is "one hundred two trillion, one hundred twelve billion, three hundred three million, two hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •