Base | Representation |
---|---|
bin | 10110111111001100101110… |
… | …001111111011111001110010 |
3 | 111020222001210121021202002000 |
4 | 112333030232033323321302 |
5 | 101222410310321010002 |
6 | 555004412014234430 |
7 | 30203143344251412 |
oct | 2677145617737162 |
9 | 436861717252060 |
10 | 101100011110002 |
11 | 2a239301666293 |
12 | b409a391b5a16 |
13 | 44548c8311088 |
14 | 1ad73a396c642 |
15 | ba4c9b21761c |
hex | 5bf32e3fbe72 |
101100011110002 has 32 divisors (see below), whose sum is σ = 228905685538560. Its totient is φ = 33064154575920.
The previous prime is 101100011109973. The next prime is 101100011110009. The reversal of 101100011110002 is 200011110001101.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (101100011110009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17662472874 + ... + 17662478597.
It is an arithmetic number, because the mean of its divisors is an integer number (7153302673080).
Almost surely, 2101100011110002 is an apocalyptic number.
101100011110002 is an abundant number, since it is smaller than the sum of its proper divisors (127805674428558).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101100011110002 is a wasteful number, since it uses less digits than its factorization.
101100011110002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35324951535 (or 35324951529 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 101100011110002 its reverse (200011110001101), we get a palindrome (301111121111103).
The spelling of 101100011110002 in words is "one hundred one trillion, one hundred billion, eleven million, one hundred ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •