Base | Representation |
---|---|
bin | 101010100101001101… |
… | …100010100011011100 |
3 | 11101000101222222020200 |
4 | 222211031202203130 |
5 | 1222114143304004 |
6 | 33000521343500 |
7 | 3206010010650 |
oct | 524515424334 |
9 | 141011888220 |
10 | 45721463004 |
11 | 18432634968 |
12 | 8a40037b90 |
13 | 4408526829 |
14 | 22da3d2a60 |
15 | 12c8e50239 |
hex | aa53628dc |
45721463004 has 72 divisors (see below), whose sum is σ = 132429373440. Its totient is φ = 13029139872.
The previous prime is 45721462937. The next prime is 45721463023. The reversal of 45721463004 is 40036412754.
45721463004 is a `hidden beast` number, since 4 + 5 + 7 + 2 + 14 + 630 + 0 + 4 = 666.
It is a super-2 number, since 2×457214630042 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 45721463004.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 140344 + ... + 333375.
Almost surely, 245721463004 is an apocalyptic number.
It is an amenable number.
45721463004 is an abundant number, since it is smaller than the sum of its proper divisors (86707910436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45721463004 is a wasteful number, since it uses less digits than its factorization.
45721463004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 474119 (or 474114 counting only the distinct ones).
The product of its (nonzero) digits is 80640, while the sum is 36.
Adding to 45721463004 its reverse (40036412754), we get a palindrome (85757875758).
The spelling of 45721463004 in words is "forty-five billion, seven hundred twenty-one million, four hundred sixty-three thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •