Base | Representation |
---|---|
bin | 10011100011101101… |
… | …001100111000101000 |
3 | 2000012112110222021200 |
4 | 103203231030320220 |
5 | 321002014141342 |
6 | 13351454004200 |
7 | 1342255204554 |
oct | 234355147050 |
9 | 60175428250 |
10 | 21000146472 |
11 | 89a7042958 |
12 | 40a0aa6660 |
13 | 1c98966696 |
14 | 1033070864 |
15 | 82d97a94c |
hex | 4e3b4ce28 |
21000146472 has 48 divisors (see below), whose sum is σ = 57119542740. Its totient is φ = 6970000128.
The previous prime is 21000146467. The next prime is 21000146477. The reversal of 21000146472 is 27464100012.
21000146472 is a `hidden beast` number, since 2 + 1 + 0 + 0 + 0 + 14 + 647 + 2 = 666.
It is an interprime number because it is at equal distance from previous prime (21000146467) and next prime (21000146477).
It can be written as a sum of positive squares in 2 ways, for example, as 20858869476 + 141276996 = 144426^2 + 11886^2 .
It is not an unprimeable number, because it can be changed into a prime (21000146477) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 609123 + ... + 642674.
Almost surely, 221000146472 is an apocalyptic number.
It is an amenable number.
21000146472 is an abundant number, since it is smaller than the sum of its proper divisors (36119396268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21000146472 is a wasteful number, since it uses less digits than its factorization.
21000146472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1252042 (or 1252035 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 27.
Adding to 21000146472 its reverse (27464100012), we get a palindrome (48464246484).
The spelling of 21000146472 in words is "twenty-one billion, one hundred forty-six thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •