Base | Representation |
---|---|
bin | 101101101101001110100100… |
… | …010100100100101000000100 |
3 | 222100202100001011211212010120 |
4 | 231231032210110210220010 |
5 | 202322003141432223022 |
6 | 1551311210401021540 |
7 | 60225136515455022 |
oct | 5555164424445004 |
9 | 870670034755116 |
10 | 201020111211012 |
11 | 59062172216795 |
12 | 1a6670646248b0 |
13 | 8822165c9c982 |
14 | 378d5d5021712 |
15 | 1838edb1dcd5c |
hex | b6d3a4524a04 |
201020111211012 has 96 divisors (see below), whose sum is σ = 495157454918784. Its totient is φ = 63388486886400.
The previous prime is 201020111210981. The next prime is 201020111211061. The reversal of 201020111211012 is 210112111020102.
It is a happy number.
It is a super-2 number, since 2×2010201112110122 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201020111210982 and 201020111211000.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13510314 + ... + 24177857.
It is an arithmetic number, because the mean of its divisors is an integer number (5157890155404).
Almost surely, 2201020111211012 is an apocalyptic number.
It is an amenable number.
201020111211012 is an abundant number, since it is smaller than the sum of its proper divisors (294137343707772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201020111211012 is a wasteful number, since it uses less digits than its factorization.
201020111211012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37688549 (or 37688547 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 201020111211012 its reverse (210112111020102), we get a palindrome (411132222231114).
The spelling of 201020111211012 in words is "two hundred one trillion, twenty billion, one hundred eleven million, two hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •