Base | Representation |
---|---|
bin | 1011101100110010011… |
… | …1001100001011111100 |
3 | 201012211010110001222020 |
4 | 2323030213030023330 |
5 | 11243122314234322 |
6 | 232201055520140 |
7 | 20344000016556 |
oct | 2731447141374 |
9 | 635733401866 |
10 | 201001321212 |
11 | 7827600769a |
12 | 32b56b29050 |
13 | 15c538cc833 |
14 | 9a2b0944d6 |
15 | 536631705c |
hex | 2ecc9cc2fc |
201001321212 has 48 divisors (see below), whose sum is σ = 470786359680. Its totient is φ = 66746112832.
The previous prime is 201001321207. The next prime is 201001321237. The reversal of 201001321212 is 212123100102.
It is a super-2 number, since 2×2010013212122 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201001321191 and 201001321200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3834403 + ... + 3886469.
It is an arithmetic number, because the mean of its divisors is an integer number (9808049160).
Almost surely, 2201001321212 is an apocalyptic number.
It is an amenable number.
201001321212 is an abundant number, since it is smaller than the sum of its proper divisors (269785038468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201001321212 is a wasteful number, since it uses less digits than its factorization.
201001321212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53290 (or 53288 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 201001321212 its reverse (212123100102), we get a palindrome (413124421314).
The spelling of 201001321212 in words is "two hundred one billion, one million, three hundred twenty-one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •