Base | Representation |
---|---|
bin | 101111010010100101… |
… | …1100010001101010010 |
3 | 100201010120121112202200 |
4 | 1132211023202031102 |
5 | 3130441202342041 |
6 | 114353131024030 |
7 | 10223432416224 |
oct | 1364513421522 |
9 | 321116545680 |
10 | 101555512146 |
11 | 3a084491430 |
12 | 1782289b016 |
13 | 9765b6a02a |
14 | 4cb5894414 |
15 | 2995a9c1b6 |
hex | 17a52e2352 |
101555512146 has 72 divisors (see below), whose sum is σ = 243471161232. Its totient is φ = 30340657200.
The previous prime is 101555512139. The next prime is 101555512159. The reversal of 101555512146 is 641215555101.
101555512146 is a `hidden beast` number, since 10 + 1 + 55 + 551 + 2 + 1 + 46 = 666.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 101555512146.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 947245 + ... + 1048991.
It is an arithmetic number, because the mean of its divisors is an integer number (3381543906).
Almost surely, 2101555512146 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101555512146, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (121735580616).
101555512146 is an abundant number, since it is smaller than the sum of its proper divisors (141915649086).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101555512146 is a wasteful number, since it uses less digits than its factorization.
101555512146 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 101908 (or 101834 counting only the distinct ones).
The product of its (nonzero) digits is 30000, while the sum is 36.
The spelling of 101555512146 in words is "one hundred one billion, five hundred fifty-five million, five hundred twelve thousand, one hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •