Base | Representation |
---|---|
bin | 11101011101001011111… |
… | …11100000001100000000 |
3 | 10120202102010211222202220 |
4 | 32232211333200030000 |
5 | 113040241130431422 |
6 | 2052541530411040 |
7 | 133056556526061 |
oct | 16564577401400 |
9 | 3522363758686 |
10 | 1012102202112 |
11 | 360259342521 |
12 | 14419ab90a80 |
13 | 74596665291 |
14 | 36db386a568 |
15 | 1b4d8e73e5c |
hex | eba5fe0300 |
1012102202112 has 36 divisors (see below), whose sum is σ = 2693667842040. Its totient is φ = 337367400448.
The previous prime is 1012102202093. The next prime is 1012102202117. The reversal of 1012102202112 is 2112022012101.
It is a junction number, because it is equal to n+sod(n) for n = 1012102202091 and 1012102202100.
It is not an unprimeable number, because it can be changed into a prime (1012102202117) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 658919937 + ... + 658921472.
Almost surely, 21012102202112 is an apocalyptic number.
1012102202112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1012102202112 is an abundant number, since it is smaller than the sum of its proper divisors (1681565639928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012102202112 is an equidigital number, since it uses as much as digits as its factorization.
1012102202112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1317841428 (or 1317841414 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1012102202112 its reverse (2112022012101), we get a palindrome (3124124214213).
The spelling of 1012102202112 in words is "one trillion, twelve billion, one hundred two million, two hundred two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •