Base | Representation |
---|---|
bin | 1101011000100001110010… |
… | …1101100011100110100110 |
3 | 1221002202002102012021002201 |
4 | 3112020130231203212212 |
5 | 3412042400123113304 |
6 | 51143555040325114 |
7 | 3046061254235500 |
oct | 326103455434646 |
9 | 57082072167081 |
10 | 14715039660454 |
11 | 47636822a4831 |
12 | 1797a5901379a |
13 | 829812215053 |
14 | 38c2d6d5cd70 |
15 | 1a7b8a5013a4 |
hex | d621cb639a6 |
14715039660454 has 48 divisors (see below), whose sum is σ = 27193033370160. Its totient is φ = 5934075786240.
The previous prime is 14715039660397. The next prime is 14715039660551. The reversal of 14715039660454 is 45406693051741.
14715039660454 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×147150396604542 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14715039660395 and 14715039660404.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6024177 + ... + 8106835.
It is an arithmetic number, because the mean of its divisors is an integer number (566521528545).
Almost surely, 214715039660454 is an apocalyptic number.
14715039660454 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
14715039660454 is a deficient number, since it is larger than the sum of its proper divisors (12477993709706).
14715039660454 is a wasteful number, since it uses less digits than its factorization.
14715039660454 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2086933 (or 2086926 counting only the distinct ones).
The product of its (nonzero) digits is 10886400, while the sum is 55.
The spelling of 14715039660454 in words is "fourteen trillion, seven hundred fifteen billion, thirty-nine million, six hundred sixty thousand, four hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •