Base | Representation |
---|---|
bin | 11011000110110001… |
… | …01000001101111001 |
3 | 1101120011201120010002 |
4 | 31203120220031321 |
5 | 214300342134312 |
6 | 10404002202345 |
7 | 1023422346530 |
oct | 154330501571 |
9 | 41504646102 |
10 | 14552302457 |
11 | 6198439250 |
12 | 29a16533b5 |
13 | 14abb77374 |
14 | 9c09a5317 |
15 | 5a287d4c2 |
hex | 363628379 |
14552302457 has 32 divisors (see below), whose sum is σ = 19026074880. Its totient is φ = 10798341120.
The previous prime is 14552302451. The next prime is 14552302459. The reversal of 14552302457 is 75420325541.
14552302457 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 14552302457 - 28 = 14552302201 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 14552302457.
It is not an unprimeable number, because it can be changed into a prime (14552302451) 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 31 ways as a sum of consecutive naturals, for example, 118373 + ... + 207645.
It is an arithmetic number, because the mean of its divisors is an integer number (594564840).
Almost surely, 214552302457 is an apocalyptic number.
It is an amenable number.
14552302457 is a deficient number, since it is larger than the sum of its proper divisors (4473772423).
14552302457 is a wasteful number, since it uses less digits than its factorization.
14552302457 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89393.
The product of its (nonzero) digits is 168000, while the sum is 38.
Adding to 14552302457 its reverse (75420325541), we get a palindrome (89972627998).
The spelling of 14552302457 in words is "fourteen billion, five hundred fifty-two million, three hundred two thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •