Base | Representation |
---|---|
bin | 11010100001001011… |
… | …00001010101101111 |
3 | 1100202012021012221012 |
4 | 31100211201111233 |
5 | 213124122240210 |
6 | 10312414255435 |
7 | 1012542531656 |
oct | 152045412557 |
9 | 40665235835 |
10 | 14236915055 |
11 | 6046405000 |
12 | 2913ab757b |
13 | 145b71c7bc |
14 | 990b4819d |
15 | 584d30305 |
hex | 35096156f |
14236915055 has 64 divisors (see below), whose sum is σ = 19352908800. Its totient is φ = 10049776000.
The previous prime is 14236915037. The next prime is 14236915079. The reversal of 14236915055 is 55051963241.
14236915055 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 14236915055 - 220 = 14235866479 is a prime.
It is a congruent number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 39656966 + ... + 39657324.
It is an arithmetic number, because the mean of its divisors is an integer number (302389200).
Almost surely, 214236915055 is an apocalyptic number.
14236915055 is a deficient number, since it is larger than the sum of its proper divisors (5115993745).
14236915055 is a wasteful number, since it uses less digits than its factorization.
14236915055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 557 (or 535 counting only the distinct ones).
The product of its (nonzero) digits is 162000, while the sum is 41.
The spelling of 14236915055 in words is "fourteen billion, two hundred thirty-six million, nine hundred fifteen thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •