Base | Representation |
---|---|
bin | 10010101000000111… |
… | …00011001001110000 |
3 | 221210221001022110121 |
4 | 21110003203021300 |
5 | 130440014314102 |
6 | 4332145540024 |
7 | 502545611425 |
oct | 112403431160 |
9 | 27727038417 |
10 | 10000151152 |
11 | 4271908632 |
12 | 1b31044614 |
13 | c34a41204 |
14 | 6ac1a1d4c |
15 | 3d7ddcb37 |
hex | 2540e3270 |
10000151152 has 10 divisors (see below), whose sum is σ = 19375292888. Its totient is φ = 5000075568.
The previous prime is 10000151137. The next prime is 10000151153. The reversal of 10000151152 is 25115100001.
It is a Harshad number since it is a multiple of its sum of digits (16), and also a Moran number because the ratio is a prime number: 625009447 = 10000151152 / (1 + 0 + 0 + 0 + 0 + 1 + 5 + 1 + 1 + 5 + 2).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10000151153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 312504708 + ... + 312504739.
Almost surely, 210000151152 is an apocalyptic number.
It is an amenable number.
10000151152 is a deficient number, since it is larger than the sum of its proper divisors (9375141736).
10000151152 is an equidigital number, since it uses as much as digits as its factorization.
10000151152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 625009455 (or 625009449 counting only the distinct ones).
The product of its (nonzero) digits is 50, while the sum is 16.
Adding to 10000151152 its reverse (25115100001), we get a palindrome (35115251153).
The spelling of 10000151152 in words is "ten billion, one hundred fifty-one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •