Base | Representation |
---|---|
bin | 10110111111001100110100… |
… | …010001001110100110000010 |
3 | 111020222002001122100011202211 |
4 | 112333030310101032212002 |
5 | 101222411012200041002 |
6 | 555004430023132334 |
7 | 30203146011616033 |
oct | 2677146421164602 |
9 | 436862048304684 |
10 | 101100112112002 |
11 | 2a239353681613 |
12 | b409a66ba40aa |
13 | 4454913215983 |
14 | 1ad73b3140a8a |
15 | ba4ca5018dd7 |
hex | 5bf33444e982 |
101100112112002 has 8 divisors (see below), whose sum is σ = 154136236498812. Its totient is φ = 49721366612400.
The previous prime is 101100112111969. The next prime is 101100112112011. The reversal of 101100112112002 is 200211211001101.
It is a happy number.
101100112112002 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 98378209379241 + 2721902732761 = 9918579^2 + 1649819^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 414344721649 + ... + 414344721892.
Almost surely, 2101100112112002 is an apocalyptic number.
101100112112002 is a deficient number, since it is larger than the sum of its proper divisors (53036124386810).
101100112112002 is an equidigital number, since it uses as much as digits as its factorization.
101100112112002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 828689443604.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101100112112002 its reverse (200211211001101), we get a palindrome (301311323113103).
The spelling of 101100112112002 in words is "one hundred one trillion, one hundred billion, one hundred twelve million, one hundred twelve thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •