Base | Representation |
---|---|
bin | 11110110110101100111… |
… | …110101110001001000001 |
3 | 21111200220211000221200110 |
4 | 132312230332232021001 |
5 | 234214404134000001 |
6 | 4302021221341533 |
7 | 306121350062361 |
oct | 36665476561101 |
9 | 7450824027613 |
10 | 2120321000001 |
11 | 74824aa22a66 |
12 | 2a2b232678a9 |
13 | 124c3a0bcb69 |
14 | 748a46b49a1 |
15 | 3a24b23e3d6 |
hex | 1edacfae241 |
2120321000001 has 16 divisors (see below), whose sum is σ = 2903547593600. Its totient is φ = 1375322053248.
The previous prime is 2120320999939. The next prime is 2120321000009. The reversal of 2120321000001 is 1000001230212.
It is not a de Polignac number, because 2120321000001 - 210 = 2120320998977 is a prime.
It is a super-3 number, since 3×21203210000013 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2120321000009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10471245 + ... + 10671813.
It is an arithmetic number, because the mean of its divisors is an integer number (181471724600).
Almost surely, 22120321000001 is an apocalyptic number.
It is an amenable number.
2120321000001 is a deficient number, since it is larger than the sum of its proper divisors (783226593599).
2120321000001 is a wasteful number, since it uses less digits than its factorization.
2120321000001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 295848.
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 2120321000001 its reverse (1000001230212), we get a palindrome (3120322230213).
The spelling of 2120321000001 in words is "two trillion, one hundred twenty billion, three hundred twenty-one million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •