Base | Representation |
---|---|
bin | 10110111111010110000010… |
… | …110101101010100001001001 |
3 | 111021000000122011012021010210 |
4 | 112333112002311222201021 |
5 | 101223041310134033001 |
6 | 555013145124231333 |
7 | 30203646362301141 |
oct | 2677260265524111 |
9 | 437000564167123 |
10 | 101110020221001 |
11 | 2a242578533550 |
12 | b40b97123b549 |
13 | 4455831b6b56c |
14 | 1ad7a72dc3921 |
15 | ba5184cc4dd6 |
hex | 5bf582d6a849 |
101110020221001 has 16 divisors (see below), whose sum is σ = 147071491603200. Its totient is φ = 61277812099920.
The previous prime is 101110020220997. The next prime is 101110020221003. The reversal of 101110020221001 is 100122020011101.
It is not a de Polignac number, because 101110020221001 - 22 = 101110020220997 is a prime.
It is a super-2 number, since 2×1011100202210012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101110020221003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22620535 + ... + 26719068.
It is an arithmetic number, because the mean of its divisors is an integer number (9191968225200).
Almost surely, 2101110020221001 is an apocalyptic number.
101110020221001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101110020221001 is a deficient number, since it is larger than the sum of its proper divisors (45961471382199).
101110020221001 is a wasteful number, since it uses less digits than its factorization.
101110020221001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49401716.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101110020221001 its reverse (100122020011101), we get a palindrome (201232040232102).
The spelling of 101110020221001 in words is "one hundred one trillion, one hundred ten billion, twenty million, two hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •