Base | Representation |
---|---|
bin | 1000000000111001… |
… | …0000111011110111 |
3 | 12112220220110020002 |
4 | 2000032100323313 |
5 | 13401203114111 |
6 | 553244101515 |
7 | 104211044156 |
oct | 20016207367 |
9 | 5486813202 |
10 | 2151223031 |
11 | a04344781 |
12 | 50053489b |
13 | 2838b3b49 |
14 | 1659c159d |
15 | c8cd463b |
hex | 80390ef7 |
2151223031 has 8 divisors (see below), whose sum is σ = 2211109344. Its totient is φ = 2091428640.
The previous prime is 2151223007. The next prime is 2151223033. The reversal of 2151223031 is 1303221512.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2151223031 - 214 = 2151206647 is a prime.
It is a super-2 number, since 2×21512230312 = 9255521058209653922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2151222994 and 2151223012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2151223033) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25901 + ... + 70521.
It is an arithmetic number, because the mean of its divisors is an integer number (276388668).
Almost surely, 22151223031 is an apocalyptic number.
2151223031 is a deficient number, since it is larger than the sum of its proper divisors (59886313).
2151223031 is a wasteful number, since it uses less digits than its factorization.
2151223031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45961.
The product of its (nonzero) digits is 360, while the sum is 20.
The square root of 2151223031 is about 46381.2788849122. The cubic root of 2151223031 is about 1290.9075661769.
Adding to 2151223031 its reverse (1303221512), we get a palindrome (3454444543).
The spelling of 2151223031 in words is "two billion, one hundred fifty-one million, two hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •