Base | Representation |
---|---|
bin | 1101001110010000110101… |
… | …0010111000011011000000 |
3 | 1220110212220010012200212001 |
4 | 3103210031102320123000 |
5 | 3401200212430203324 |
6 | 50530551502313344 |
7 | 3030246140314234 |
oct | 323441522703300 |
9 | 56425803180761 |
10 | 14538687350464 |
11 | 46a5905a940a2 |
12 | 1769840b88854 |
13 | 815cb920a774 |
14 | 3839677a85c4 |
15 | 1a32b8179e44 |
hex | d390d4b86c0 |
14538687350464 has 14 divisors (see below), whose sum is σ = 28850207711204. Its totient is φ = 7269343675200.
The previous prime is 14538687350413. The next prime is 14538687350503. The reversal of 14538687350464 is 46405378683541.
It is a super-2 number, since 2×145386873504642 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (64), and also a Moran number because the ratio is a prime number: 227166989851 = 14538687350464 / (1 + 4 + 5 + 3 + 8 + 6 + 8 + 7 + 3 + 5 + 0 + 4 + 6 + 4).
It is a junction number, because it is equal to n+sod(n) for n = 14538687350396 and 14538687350405.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 113583494862 + ... + 113583494989.
Almost surely, 214538687350464 is an apocalyptic number.
It is an amenable number.
14538687350464 is a deficient number, since it is larger than the sum of its proper divisors (14311520360740).
14538687350464 is an equidigital number, since it uses as much as digits as its factorization.
14538687350464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227166989863 (or 227166989853 counting only the distinct ones).
The product of its (nonzero) digits is 232243200, while the sum is 64.
The spelling of 14538687350464 in words is "fourteen trillion, five hundred thirty-eight billion, six hundred eighty-seven million, three hundred fifty thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •