Base | Representation |
---|---|
bin | 11010000101000101… |
… | …00001111101101011 |
3 | 1100010202211012110120 |
4 | 31002202201331223 |
5 | 212133310001110 |
6 | 10233155214323 |
7 | 1003651443204 |
oct | 150242417553 |
9 | 40122735416 |
10 | 14001250155 |
11 | 5a35382522 |
12 | 2868ba73a3 |
13 | 1421958c09 |
14 | 96b7205ab |
15 | 56e2cd870 |
hex | 3428a1f6b |
14001250155 has 16 divisors (see below), whose sum is σ = 22435303200. Its totient is φ = 7456232448.
The previous prime is 14001250127. The next prime is 14001250183. The reversal of 14001250155 is 55105210041.
14001250155 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (14001250127) and next prime (14001250183).
It is not a de Polignac number, because 14001250155 - 29 = 14001249643 is a prime.
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 15 ways as a sum of consecutive naturals, for example, 683380 + ... + 703569.
It is an arithmetic number, because the mean of its divisors is an integer number (1402206450).
Almost surely, 214001250155 is an apocalyptic number.
14001250155 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
14001250155 is a deficient number, since it is larger than the sum of its proper divisors (8434053045).
14001250155 is a wasteful number, since it uses less digits than its factorization.
14001250155 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1387630.
The product of its (nonzero) digits is 1000, while the sum is 24.
Adding to 14001250155 its reverse (55105210041), we get a palindrome (69106460196).
The spelling of 14001250155 in words is "fourteen billion, one million, two hundred fifty thousand, one hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •