Base | Representation |
---|---|
bin | 11101011101011010001… |
… | …01011100111100011001 |
3 | 10120202201102202211012121 |
4 | 32232231011130330121 |
5 | 113041012111432301 |
6 | 2053001421141241 |
7 | 133062533154106 |
oct | 16565505347431 |
9 | 3522642684177 |
10 | 1012221202201 |
11 | 36030a531000 |
12 | 1442129ba821 |
13 | 745b51cc031 |
14 | 36dc55a5aad |
15 | 1b4e462d3a1 |
hex | ebad15cf19 |
1012221202201 has 64 divisors (see below), whose sum is σ = 1177516984320. Its totient is φ = 868333752000.
The previous prime is 1012221202177. The next prime is 1012221202229. The reversal of 1012221202201 is 1022021222101.
It is a happy number.
It is not a de Polignac number, because 1012221202201 - 215 = 1012221169433 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1012221202231) 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 63 ways as a sum of consecutive naturals, for example, 1369717090 + ... + 1369717828.
It is an arithmetic number, because the mean of its divisors is an integer number (18398702880).
Almost surely, 21012221202201 is an apocalyptic number.
1012221202201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1012221202201 is a deficient number, since it is larger than the sum of its proper divisors (165295782119).
1012221202201 is a wasteful number, since it uses less digits than its factorization.
1012221202201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1339 (or 1317 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 1012221202201 its reverse (1022021222101), we get a palindrome (2034242424302).
The spelling of 1012221202201 in words is "one trillion, twelve billion, two hundred twenty-one million, two hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •