Base | Representation |
---|---|
bin | 10110111111100001001110… |
… | …000101001110101111111001 |
3 | 111021001011121102220202102110 |
4 | 112333201032011032233321 |
5 | 101223240344110323001 |
6 | 555022451545322533 |
7 | 30204552631651503 |
oct | 2677411605165771 |
9 | 437034542822373 |
10 | 101122020011001 |
11 | 2a247676061370 |
12 | b41215ba96449 |
13 | 44569c4c5b612 |
14 | 1ad8490988d73 |
15 | ba56385033d6 |
hex | 5bf84e14ebf9 |
101122020011001 has 64 divisors (see below), whose sum is σ = 149991754199040. Its totient is φ = 60077614371840.
The previous prime is 101122020010951. The next prime is 101122020011029. The reversal of 101122020011001 is 100110020221101.
It is not a de Polignac number, because 101122020011001 - 27 = 101122020010873 is a prime.
It is a super-2 number, since 2×1011220200110012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101122020011071) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 13032863760 + ... + 13032871518.
It is an arithmetic number, because the mean of its divisors is an integer number (2343621159360).
Almost surely, 2101122020011001 is an apocalyptic number.
101122020011001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101122020011001 is a deficient number, since it is larger than the sum of its proper divisors (48869734188039).
101122020011001 is a wasteful number, since it uses less digits than its factorization.
101122020011001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13326.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101122020011001 its reverse (100110020221101), we get a palindrome (201232040232102).
The spelling of 101122020011001 in words is "one hundred one trillion, one hundred twenty-two billion, twenty million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •