Base | Representation |
---|---|
bin | 101110101000110010… |
… | …0110101000011010101 |
3 | 100120111211021021100021 |
4 | 1131101210311003111 |
5 | 3120103112404124 |
6 | 114002023145141 |
7 | 10143611144056 |
oct | 1352144650325 |
9 | 316454237307 |
10 | 100152856789 |
11 | 39524749727 |
12 | 174b0ba51b1 |
13 | 95a139ba4b |
14 | 4bc149072d |
15 | 29128807e4 |
hex | 17519350d5 |
100152856789 has 8 divisors (see below), whose sum is σ = 106167955608. Its totient is φ = 94151508480.
The previous prime is 100152856777. The next prime is 100152856801. The reversal of 100152856789 is 987658251001.
It is an interprime number because it is at equal distance from previous prime (100152856777) and next prime (100152856801).
It can be written as a sum of positive squares in 4 ways, for example, as 32873316100 + 67279540689 = 181310^2 + 259383^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100152856789 - 25 = 100152856757 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100152856709) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3422622 + ... + 3451759.
It is an arithmetic number, because the mean of its divisors is an integer number (13270994451).
Almost surely, 2100152856789 is an apocalyptic number.
It is an amenable number.
100152856789 is a deficient number, since it is larger than the sum of its proper divisors (6015098819).
100152856789 is an equidigital number, since it uses as much as digits as its factorization.
100152856789 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6875255.
The product of its (nonzero) digits is 1209600, while the sum is 52.
The spelling of 100152856789 in words is "one hundred billion, one hundred fifty-two million, eight hundred fifty-six thousand, seven hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •