Base | Representation |
---|---|
bin | 1001010011101100010… |
… | …0111111110000000111 |
3 | 120021202001101101022112 |
4 | 2110323010333300013 |
5 | 10104441132033044 |
6 | 201243114051235 |
7 | 14360410460150 |
oct | 2247304776007 |
9 | 507661341275 |
10 | 159904955399 |
11 | 618a71a6802 |
12 | 26ba7a19b1b |
13 | 1210466c807 |
14 | 7a4d052927 |
15 | 425d46609e |
hex | 253b13fc07 |
159904955399 has 64 divisors (see below), whose sum is σ = 200581742592. Its totient is φ = 124366233600.
The previous prime is 159904955389. The next prime is 159904955417. The reversal of 159904955399 is 993559409951.
It is not a de Polignac number, because 159904955399 - 212 = 159904951303 is a prime.
It is a super-2 number, since 2×1599049553992 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (159904955389) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 156615509 + ... + 156616529.
It is an arithmetic number, because the mean of its divisors is an integer number (3134089728).
Almost surely, 2159904955399 is an apocalyptic number.
159904955399 is a deficient number, since it is larger than the sum of its proper divisors (40676787193).
159904955399 is a wasteful number, since it uses less digits than its factorization.
159904955399 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1456.
The product of its (nonzero) digits is 88573500, while the sum is 68.
The spelling of 159904955399 in words is "one hundred fifty-nine billion, nine hundred four million, nine hundred fifty-five thousand, three hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •