Base | Representation |
---|---|
bin | 11011101100101101… |
… | …10011001111110100 |
3 | 1102101100122021011100 |
4 | 31312112303033310 |
5 | 220423332343302 |
6 | 10455332210100 |
7 | 1034335635054 |
oct | 156626631764 |
9 | 42340567140 |
10 | 14870590452 |
11 | 6341073783 |
12 | 2a70169930 |
13 | 152caa9263 |
14 | a10d79564 |
15 | 5c07a0d1c |
hex | 3765b33f4 |
14870590452 has 72 divisors (see below), whose sum is σ = 37823432192. Its totient is φ = 4926096000.
The previous prime is 14870590451. The next prime is 14870590457. The reversal of 14870590452 is 25409507841.
14870590452 is a `hidden beast` number, since 1 + 4 + 8 + 7 + 0 + 590 + 4 + 52 = 666.
It is a super-2 number, since 2×148705904522 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14870590398 and 14870590407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14870590451) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8255952 + ... + 8257752.
Almost surely, 214870590452 is an apocalyptic number.
14870590452 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14870590452 is an abundant number, since it is smaller than the sum of its proper divisors (22952841740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14870590452 is a wasteful number, since it uses less digits than its factorization.
14870590452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3109 (or 3104 counting only the distinct ones).
The product of its (nonzero) digits is 403200, while the sum is 45.
The spelling of 14870590452 in words is "fourteen billion, eight hundred seventy million, five hundred ninety thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •