Base | Representation |
---|---|
bin | 1001001011111011010011… |
… | …00011011110110111000100 |
3 | 2122112012022120101020221220 |
4 | 10211331221203132313010 |
5 | 10121433123014232322 |
6 | 110544113502440340 |
7 | 4153321443503451 |
oct | 445755143366704 |
9 | 78465276336856 |
10 | 20201002102212 |
11 | 6489219058488 |
12 | 232310a8930b0 |
13 | b36c3c0c7ba9 |
14 | 4dba3b476828 |
15 | 25071b2a455c |
hex | 125f698dedc4 |
20201002102212 has 12 divisors (see below), whose sum is σ = 47135671571856. Its totient is φ = 6733667367400.
The previous prime is 20201002102187. The next prime is 20201002102217. The reversal of 20201002102212 is 21220120010202.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 20201002102191 and 20201002102200.
It is not an unprimeable number, because it can be changed into a prime (20201002102217) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 841708420914 + ... + 841708420937.
It is an arithmetic number, because the mean of its divisors is an integer number (3927972630988).
Almost surely, 220201002102212 is an apocalyptic number.
It is an amenable number.
20201002102212 is an abundant number, since it is smaller than the sum of its proper divisors (26934669469644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20201002102212 is a wasteful number, since it uses less digits than its factorization.
20201002102212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1683416841858 (or 1683416841856 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 20201002102212 its reverse (21220120010202), we get a palindrome (41421122112414).
The spelling of 20201002102212 in words is "twenty trillion, two hundred one billion, two million, one hundred two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •