Base | Representation |
---|---|
bin | 10110111110000010010101… |
… | …000010010001011111000011 |
3 | 111020200102121122011000201021 |
4 | 112332002111002101133003 |
5 | 101220103212041444021 |
6 | 554504001350450311 |
7 | 30164315011246246 |
oct | 2676022502213703 |
9 | 436612548130637 |
10 | 101020131203011 |
11 | 2a208440524929 |
12 | b3b6465663997 |
13 | 444a208036617 |
14 | 1ad3586b3525d |
15 | ba2b7356bc41 |
hex | 5be0950917c3 |
101020131203011 has 4 divisors (see below), whose sum is σ = 101043137386224. Its totient is φ = 100997125019800.
The previous prime is 101020131202973. The next prime is 101020131203041. The reversal of 101020131203011 is 110302131020101.
It is a happy number.
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 101020131203011 - 217 = 101020131071939 is a prime.
It is a super-2 number, since 2×1010201312030112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101020131203041) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11503085020 + ... + 11503093801.
It is an arithmetic number, because the mean of its divisors is an integer number (25260784346556).
Almost surely, 2101020131203011 is an apocalyptic number.
101020131203011 is a deficient number, since it is larger than the sum of its proper divisors (23006183213).
101020131203011 is an equidigital number, since it uses as much as digits as its factorization.
101020131203011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23006183212.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 101020131203011 its reverse (110302131020101), we get a palindrome (211322262223112).
The spelling of 101020131203011 in words is "one hundred one trillion, twenty billion, one hundred thirty-one million, two hundred three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •