Base | Representation |
---|---|
bin | 111111111110010… |
… | …1110100111101111 |
3 | 12112121020220022211 |
4 | 1333330232213233 |
5 | 13344014013111 |
6 | 553001351251 |
7 | 104124006634 |
oct | 17774564757 |
9 | 5477226284 |
10 | 2146626031 |
11 | a01794a00 |
12 | 4baa98527 |
13 | 282964624 |
14 | 16514618b |
15 | c86c7521 |
hex | 7ff2e9ef |
2146626031 has 12 divisors (see below), whose sum is σ = 2435632192. Its totient is φ = 1888524000.
The previous prime is 2146626019. The next prime is 2146626037. The reversal of 2146626031 is 1306266412.
It is not a de Polignac number, because 2146626031 - 29 = 2146625519 is a prime.
It is a super-2 number, since 2×21466260312 = 9216006633933625922, which contains 22 as substring.
It is a hoax number, since the sum of its digits (31) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2146625984 and 2146626002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2146626037) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 282390 + ... + 289891.
Almost surely, 22146626031 is an apocalyptic number.
2146626031 is a deficient number, since it is larger than the sum of its proper divisors (289006161).
2146626031 is a wasteful number, since it uses less digits than its factorization.
2146626031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 572334 (or 572323 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 31.
The square root of 2146626031 is about 46331.6957492384. The cubic root of 2146626031 is about 1289.9873866523.
The spelling of 2146626031 in words is "two billion, one hundred forty-six million, six hundred twenty-six thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •