Base | Representation |
---|---|
bin | 11010111111001010… |
… | …01100000100000111 |
3 | 1101101201122100121012 |
4 | 31133211030010013 |
5 | 214133023024101 |
6 | 10353402312435 |
7 | 1022016046256 |
oct | 153745140407 |
9 | 41351570535 |
10 | 14488486151 |
11 | 61654110a7 |
12 | 29841b871b |
13 | 149b892339 |
14 | 9b631279d |
15 | 59be74bbb |
hex | 35f94c107 |
14488486151 has 8 divisors (see below), whose sum is σ = 15320635008. Its totient is φ = 13679136000.
The previous prime is 14488486093. The next prime is 14488486153. The reversal of 14488486151 is 15168488441.
14488486151 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.
It is a cyclic number.
It is not a de Polignac number, because 14488486151 - 214 = 14488469767 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 14488486151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14488486153) 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 7 ways as a sum of consecutive naturals, for example, 5698370 + ... + 5700911.
It is an arithmetic number, because the mean of its divisors is an integer number (1915079376).
Almost surely, 214488486151 is an apocalyptic number.
14488486151 is a deficient number, since it is larger than the sum of its proper divisors (832148857).
14488486151 is a wasteful number, since it uses less digits than its factorization.
14488486151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11399353.
The product of its digits is 983040, while the sum is 50.
The spelling of 14488486151 in words is "fourteen billion, four hundred eighty-eight million, four hundred eighty-six thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •