Base | Representation |
---|---|
bin | 1000000001010101… |
… | …1011011010000011 |
3 | 12120001102212012221 |
4 | 2000111123122003 |
5 | 13402143212211 |
6 | 553352231511 |
7 | 104233025122 |
oct | 20025333203 |
9 | 5501385187 |
10 | 2153100931 |
11 | a05407663 |
12 | 50109b597 |
13 | 2840c0827 |
14 | 165d4dab9 |
15 | c9055c71 |
hex | 8055b683 |
2153100931 has 8 divisors (see below), whose sum is σ = 2175361344. Its totient is φ = 2130859200.
The previous prime is 2153100923. The next prime is 2153100941. The reversal of 2153100931 is 1390013512.
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 2153100931 - 23 = 2153100923 is a prime.
It is a super-2 number, since 2×21531009312 = 9271687238146133522, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2153100896 and 2153100905.
It is not an unprimeable number, because it can be changed into a prime (2153100941) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 447766 + ... + 452548.
It is an arithmetic number, because the mean of its divisors is an integer number (271920168).
Almost surely, 22153100931 is an apocalyptic number.
2153100931 is a deficient number, since it is larger than the sum of its proper divisors (22260413).
2153100931 is a wasteful number, since it uses less digits than its factorization.
2153100931 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9341.
The product of its (nonzero) digits is 810, while the sum is 25.
The square root of 2153100931 is about 46401.5186281656. The cubic root of 2153100931 is about 1291.2830874856.
The spelling of 2153100931 in words is "two billion, one hundred fifty-three million, one hundred thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •