Base | Representation |
---|---|
bin | 10111000000101010111110… |
… | …001111101100000101000110 |
3 | 111021022202000102010120220122 |
4 | 113000222332033230011012 |
5 | 101231040040032241402 |
6 | 555123110011501542 |
7 | 30213355233032021 |
oct | 2700527617540506 |
9 | 437282012116818 |
10 | 101201211212102 |
11 | 2a278213467901 |
12 | b425580a578b2 |
13 | 446130564c5b1 |
14 | 1adc2441481b8 |
15 | ba77209acca2 |
hex | 5c0abe3ec146 |
101201211212102 has 8 divisors (see below), whose sum is σ = 151827446046936. Its totient is φ = 50592062529792.
The previous prime is 101201211212093. The next prime is 101201211212149. The reversal of 101201211212102 is 201212112102101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×1012012112121023 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
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, 4271523323 + ... + 4271547014.
It is an arithmetic number, because the mean of its divisors is an integer number (18978430755867).
Almost surely, 2101201211212102 is an apocalyptic number.
101201211212102 is a deficient number, since it is larger than the sum of its proper divisors (50626234834834).
101201211212102 is an equidigital number, since it uses as much as digits as its factorization.
101201211212102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8543076262.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 101201211212102 its reverse (201212112102101), we get a palindrome (302413323314203).
The spelling of 101201211212102 in words is "one hundred one trillion, two hundred one billion, two hundred eleven million, two hundred twelve thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •