Base | Representation |
---|---|
bin | 101101110000000001011000… |
… | …111111110100111111001000 |
3 | 222101102200122200011021120121 |
4 | 231300001120333310333020 |
5 | 202333124410434310440 |
6 | 1551535323341233024 |
7 | 60245044635023503 |
oct | 5560013077647710 |
9 | 871380580137517 |
10 | 201212121010120 |
11 | 591266437a2780 |
12 | 1a698310262774 |
13 | 88372b5aca00c |
14 | 3798a0bc6a13a |
15 | 183dec7e5034a |
hex | b70058ff4fc8 |
201212121010120 has 32 divisors (see below), whose sum is σ = 493884297025920. Its totient is φ = 73168044003520.
The previous prime is 201212121010093. The next prime is 201212121010141. The reversal of 201212121010120 is 21010121212102.
It is a junction number, because it is equal to n+sod(n) for n = 201212121010094 and 201212121010103.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 228650137072 + ... + 228650137951.
It is an arithmetic number, because the mean of its divisors is an integer number (15433884282060).
Almost surely, 2201212121010120 is an apocalyptic number.
201212121010120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201212121010120 is an abundant number, since it is smaller than the sum of its proper divisors (292672176015800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201212121010120 is a wasteful number, since it uses less digits than its factorization.
201212121010120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 457300275045 (or 457300275041 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 201212121010120 its reverse (21010121212102), we get a palindrome (222222242222222).
The spelling of 201212121010120 in words is "two hundred one trillion, two hundred twelve billion, one hundred twenty-one million, ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •