Base | Representation |
---|---|
bin | 101111000101000011… |
… | …0001000101011000010 |
3 | 100122221220120121221201 |
4 | 1132022012020223002 |
5 | 3124023341041002 |
6 | 114240055411414 |
7 | 10206244162402 |
oct | 1361206105302 |
9 | 318856517851 |
10 | 101101112002 |
11 | 39970a3a920 |
12 | 17716683b6a |
13 | 96c298c5c7 |
14 | 4c713ac802 |
15 | 296ac40087 |
hex | 178a188ac2 |
101101112002 has 48 divisors (see below), whose sum is σ = 174906322272. Its totient is φ = 43460922240.
The previous prime is 101101111999. The next prime is 101101112033. The reversal of 101101112002 is 200211101101.
It is a self number, because there is not a number n which added to its sum of digits gives 101101112002.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4698873 + ... + 4720339.
It is an arithmetic number, because the mean of its divisors is an integer number (3643881714).
Almost surely, 2101101112002 is an apocalyptic number.
101101112002 is a deficient number, since it is larger than the sum of its proper divisors (73805210270).
101101112002 is a wasteful number, since it uses less digits than its factorization.
101101112002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22111 (or 22092 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 101101112002 its reverse (200211101101), we get a palindrome (301312213103).
The spelling of 101101112002 in words is "one hundred one billion, one hundred one million, one hundred twelve thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •