Base | Representation |
---|---|
bin | 11001111001001100… |
… | …01111001010100001 |
3 | 1022212211020100010120 |
4 | 30330212033022201 |
5 | 211432244332213 |
6 | 10215234350453 |
7 | 1001331203610 |
oct | 147446171241 |
9 | 38784210116 |
10 | 13901558433 |
11 | 5994081674 |
12 | 283b72b429 |
13 | 14070c2829 |
14 | 95c3ad877 |
15 | 56568a423 |
hex | 33c98f2a1 |
13901558433 has 32 divisors (see below), whose sum is σ = 21825662976. Its totient is φ = 7705867008.
The previous prime is 13901558423. The next prime is 13901558443. The reversal of 13901558433 is 33485510931.
13901558433 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 (13901558423) and next prime (13901558443).
It is not a de Polignac number, because 13901558433 - 25 = 13901558401 is a prime.
It is a super-2 number, since 2×139015584332 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13901558413) 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, 49210 + ... + 173852.
It is an arithmetic number, because the mean of its divisors is an integer number (682051968).
Almost surely, 213901558433 is an apocalyptic number.
It is an amenable number.
13901558433 is a deficient number, since it is larger than the sum of its proper divisors (7924104543).
13901558433 is a wasteful number, since it uses less digits than its factorization.
13901558433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124813.
The product of its (nonzero) digits is 194400, while the sum is 42.
The spelling of 13901558433 in words is "thirteen billion, nine hundred one million, five hundred fifty-eight thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •