Base | Representation |
---|---|
bin | 1011110001101000010… |
… | …1111010010010101100 |
3 | 201100011201102202220020 |
4 | 2330122011322102230 |
5 | 11303303103020022 |
6 | 232534053122140 |
7 | 20421132666153 |
oct | 2743205722254 |
9 | 640151382806 |
10 | 202301220012 |
11 | 78882845921 |
12 | 3325a329350 |
13 | 16100000718 |
14 | 9b1198a59a |
15 | 53e04d735c |
hex | 2f1a17a4ac |
202301220012 has 48 divisors (see below), whose sum is σ = 472753677312. Its totient is φ = 67331316160.
The previous prime is 202301220007. The next prime is 202301220061. The reversal of 202301220012 is 210022103202.
It is a happy number.
202301220012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 202301219973 and 202301220000.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 39765733 + ... + 39770819.
It is an arithmetic number, because the mean of its divisors is an integer number (9849034944).
Almost surely, 2202301220012 is an apocalyptic number.
It is an amenable number.
202301220012 is an abundant number, since it is smaller than the sum of its proper divisors (270452457300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202301220012 is a wasteful number, since it uses less digits than its factorization.
202301220012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9478 (or 9476 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 202301220012 its reverse (210022103202), we get a palindrome (412323323214).
The spelling of 202301220012 in words is "two hundred two billion, three hundred one million, two hundred twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •