Base | Representation |
---|---|
bin | 10110111111001110100100… |
… | …110011011000000110000010 |
3 | 111020222020221012221111212202 |
4 | 112333032210303120012002 |
5 | 101222423344012041002 |
6 | 555005341225353202 |
7 | 30203243545426151 |
oct | 2677164463300602 |
9 | 436866835844782 |
10 | 101102000112002 |
11 | 2a23a13238099a |
12 | b40a2b3338802 |
13 | 4454b54407536 |
14 | 1ad7511ba3598 |
15 | ba4d65b56502 |
hex | 5bf3a4cd8182 |
101102000112002 has 8 divisors (see below), whose sum is σ = 151657738976016. Its totient is φ = 50549420453332.
The previous prime is 101102000111977. The next prime is 101102000112017. The reversal of 101102000112002 is 200211000201101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1011020001120022 (a number of 29 digits) contains 22 as substring.
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, 789721328 + ... + 789849339.
It is an arithmetic number, because the mean of its divisors is an integer number (18957217372002).
Almost surely, 2101102000112002 is an apocalyptic number.
101102000112002 is a deficient number, since it is larger than the sum of its proper divisors (50555738864014).
101102000112002 is a wasteful number, since it uses less digits than its factorization.
101102000112002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1579602672.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101102000112002 its reverse (200211000201101), we get a palindrome (301313000313103).
The spelling of 101102000112002 in words is "one hundred one trillion, one hundred two billion, one hundred twelve thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •