Base | Representation |
---|---|
bin | 11110110110100001110… |
… | …010011100000110101111 |
3 | 21111200102201201022001212 |
4 | 132312201302130012233 |
5 | 234214013101343043 |
6 | 4301550433025035 |
7 | 306113610056063 |
oct | 36664162340657 |
9 | 7450381638055 |
10 | 2120133231023 |
11 | 748163a34395 |
12 | 2a2a903b517b |
13 | 124c0a228a62 |
14 | 74887797aa3 |
15 | 3a2399ee018 |
hex | 1eda1c9c1af |
2120133231023 has 16 divisors (see below), whose sum is σ = 2150053355520. Its totient is φ = 2090424855456.
The previous prime is 2120133231001. The next prime is 2120133231061. The reversal of 2120133231023 is 3201323310212.
It is a cyclic number.
It is not a de Polignac number, because 2120133231023 - 26 = 2120133230959 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2120133231023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2120133230023) 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, 199762265 + ... + 199772877.
It is an arithmetic number, because the mean of its divisors is an integer number (134378334720).
Almost surely, 22120133231023 is an apocalyptic number.
2120133231023 is a deficient number, since it is larger than the sum of its proper divisors (29920124497).
2120133231023 is a wasteful number, since it uses less digits than its factorization.
2120133231023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20326.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 2120133231023 its reverse (3201323310212), we get a palindrome (5321456541235).
The spelling of 2120133231023 in words is "two trillion, one hundred twenty billion, one hundred thirty-three million, two hundred thirty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •