Base | Representation |
---|---|
bin | 11001011100111001… |
… | …00100111100001010 |
3 | 1022021021111111100110 |
4 | 30232130210330022 |
5 | 210441010121122 |
6 | 10135514015150 |
7 | 662416213623 |
oct | 145634447412 |
9 | 38237444313 |
10 | 13664145162 |
11 | 5882065558 |
12 | 27941174b6 |
13 | 1399b691c5 |
14 | 938a4ca4a |
15 | 54e8e090c |
hex | 32e724f0a |
13664145162 has 8 divisors (see below), whose sum is σ = 27328290336. Its totient is φ = 4554715052.
The previous prime is 13664145113. The next prime is 13664145167. The reversal of 13664145162 is 26154146631.
13664145162 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
13664145162 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 13664145162.
It is not an unprimeable number, because it can be changed into a prime (13664145167) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 1138678758 + ... + 1138678769.
It is an arithmetic number, because the mean of its divisors is an integer number (3416036292).
Almost surely, 213664145162 is an apocalyptic number.
13664145162 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13664145162 is a wasteful number, since it uses less digits than its factorization.
13664145162 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2277357532.
The product of its digits is 103680, while the sum is 39.
The spelling of 13664145162 in words is "thirteen billion, six hundred sixty-four million, one hundred forty-five thousand, one hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •