Base | Representation |
---|---|
bin | 10110110000111100000001… |
… | …000010100111101101011011 |
3 | 111010111101012221200021121201 |
4 | 112300330001002213231123 |
5 | 101110331230011214321 |
6 | 552534254301215031 |
7 | 30042300636155566 |
oct | 2660740102475533 |
9 | 433441187607551 |
10 | 100120000101211 |
11 | 299a0720a30342 |
12 | b28bb15561477 |
13 | 43b33773673ac |
14 | 1aa1b961834dd |
15 | b8953e795291 |
hex | 5b0f010a7b5b |
100120000101211 has 4 divisors (see below), whose sum is σ = 102448372196632. Its totient is φ = 97791628005792.
The previous prime is 100120000101181. The next prime is 100120000101323. The reversal of 100120000101211 is 112101000021001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100120000101211 - 25 = 100120000101179 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100120000111211) by changing a digit.
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, 1164186047646 + ... + 1164186047731.
It is an arithmetic number, because the mean of its divisors is an integer number (25612093049158).
Almost surely, 2100120000101211 is an apocalyptic number.
100120000101211 is a deficient number, since it is larger than the sum of its proper divisors (2328372095421).
100120000101211 is an equidigital number, since it uses as much as digits as its factorization.
100120000101211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2328372095420.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 100120000101211 its reverse (112101000021001), we get a palindrome (212221000122212).
The spelling of 100120000101211 in words is "one hundred trillion, one hundred twenty billion, one hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •