Base | Representation |
---|---|
bin | 1101001101101010011100… |
… | …1111111100000000000000 |
3 | 1220102220022011012202202100 |
4 | 3103122213033330000000 |
5 | 3401013113123234224 |
6 | 50522125331150400 |
7 | 3026432635025151 |
oct | 323324717740000 |
9 | 56386264182670 |
10 | 14528385368064 |
11 | 46a14a9871257 |
12 | 1767846a45400 |
13 | 815036aaa0a9 |
14 | 38326b4b7928 |
15 | 1a2db3a1aac9 |
hex | d36a73fc000 |
14528385368064 has 90 divisors (see below), whose sum is σ = 41969610639320. Its totient is φ = 4842795073536.
The previous prime is 14528385368047. The next prime is 14528385368137. The reversal of 14528385368064 is 46086358382541.
14528385368064 is a `hidden beast` number, since 1 + 4 + 5 + 2 + 8 + 38 + 536 + 8 + 0 + 64 = 666.
It is a super-2 number, since 2×145283853680642 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14528385367992 and 14528385368010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 49116004 + ... + 49410915.
Almost surely, 214528385368064 is an apocalyptic number.
It is an amenable number.
14528385368064 is an abundant number, since it is smaller than the sum of its proper divisors (27441225271256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14528385368064 is an frugal number, since it uses more digits than its factorization.
14528385368064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 98526953 (or 98526924 counting only the distinct ones).
The product of its (nonzero) digits is 132710400, while the sum is 63.
The spelling of 14528385368064 in words is "fourteen trillion, five hundred twenty-eight billion, three hundred eighty-five million, three hundred sixty-eight thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •