Base | Representation |
---|---|
bin | 10010111011001001… |
… | …00110011001010101 |
3 | 222020001110211102012 |
4 | 21131210212121111 |
5 | 131301402411013 |
6 | 4400051554005 |
7 | 506524650464 |
oct | 113544463125 |
9 | 28201424365 |
10 | 10159810133 |
11 | 4343a47800 |
12 | 1b765bb905 |
13 | c5bb42695 |
14 | 6c54829db |
15 | 3e6e291a8 |
hex | 25d926655 |
10159810133 has 12 divisors (see below), whose sum is σ = 11301952704. Its totient is φ = 9124902600.
The previous prime is 10159810123. The next prime is 10159810153. The reversal of 10159810133 is 33101895101.
It is a happy number.
10159810133 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10159810133 - 228 = 9891374677 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 10159810133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10159810123) 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 11 ways as a sum of consecutive naturals, for example, 495773 + ... + 515858.
It is an arithmetic number, because the mean of its divisors is an integer number (941829392).
Almost surely, 210159810133 is an apocalyptic number.
It is an amenable number.
10159810133 is a deficient number, since it is larger than the sum of its proper divisors (1142142571).
10159810133 is a wasteful number, since it uses less digits than its factorization.
10159810133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1011736 (or 1011725 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 32.
The spelling of 10159810133 in words is "ten billion, one hundred fifty-nine million, eight hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •