Base | Representation |
---|---|
bin | 11101011101001101001… |
… | …01101001100111011001 |
3 | 10120202102211200001022120 |
4 | 32232212211221213121 |
5 | 113040301210432301 |
6 | 2052542525011453 |
7 | 133060040525622 |
oct | 16564645514731 |
9 | 3522384601276 |
10 | 1012112202201 |
11 | 360263a52761 |
12 | 1441a23b3b89 |
13 | 74598756ba9 |
14 | 36db4d10a49 |
15 | 1b4d9c9be36 |
hex | eba69699d9 |
1012112202201 has 8 divisors (see below), whose sum is σ = 1350719863584. Its totient is φ = 674123004480.
The previous prime is 1012112202197. The next prime is 1012112202209. The reversal of 1012112202201 is 1022022112101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1012112202201 - 22 = 1012112202197 is a prime.
It is a super-2 number, since 2×10121122022012 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1012112202209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 154612096 + ... + 154618641.
It is an arithmetic number, because the mean of its divisors is an integer number (168839982948).
Almost surely, 21012112202201 is an apocalyptic number.
It is an amenable number.
1012112202201 is a deficient number, since it is larger than the sum of its proper divisors (338607661383).
1012112202201 is a wasteful number, since it uses less digits than its factorization.
1012112202201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 309231831.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1012112202201 its reverse (1022022112101), we get a palindrome (2034134314302).
The spelling of 1012112202201 in words is "one trillion, twelve billion, one hundred twelve million, two hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •