Base | Representation |
---|---|
bin | 10110111110000010010100… |
… | …010111100111100000010011 |
3 | 111020200102120212002220220010 |
4 | 112332002110113213200103 |
5 | 101220103201211133021 |
6 | 554504000311050003 |
7 | 30164314514224542 |
oct | 2676022427474023 |
9 | 436612525086803 |
10 | 101020120021011 |
11 | 2a208435187704 |
12 | b3b6461970903 |
13 | 444a20591ca59 |
14 | 1ad3585464159 |
15 | ba2b725ad976 |
hex | 5be0945e7813 |
101020120021011 has 4 divisors (see below), whose sum is σ = 134693493361352. Its totient is φ = 67346746680672.
The previous prime is 101020120020977. The next prime is 101020120021013. The reversal of 101020120021011 is 110120021020101.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 101020120021011 - 29 = 101020120020499 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101020120021013) 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, 16836686670166 + ... + 16836686670171.
It is an arithmetic number, because the mean of its divisors is an integer number (33673373340338).
Almost surely, 2101020120021011 is an apocalyptic number.
101020120021011 is a deficient number, since it is larger than the sum of its proper divisors (33673373340341).
101020120021011 is an equidigital number, since it uses as much as digits as its factorization.
101020120021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33673373340340.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101020120021011 its reverse (110120021020101), we get a palindrome (211140141041112).
The spelling of 101020120021011 in words is "one hundred one trillion, twenty billion, one hundred twenty million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •