Base | Representation |
---|---|
bin | 10110101111100000110111… |
… | …100001110111001101001001 |
3 | 111010011000121012211200001212 |
4 | 112233200313201313031021 |
5 | 101102230310240404001 |
6 | 552421310541422505 |
7 | 30032234424144500 |
oct | 2657406741671511 |
9 | 433130535750055 |
10 | 100022130013001 |
11 | 29963168903519 |
12 | b274b60b6aa35 |
13 | 43a707abb95b1 |
14 | 1a9b14dd57837 |
15 | b86c125307bb |
hex | 5af837877349 |
100022130013001 has 12 divisors (see below), whose sum is σ = 116496096075540. Its totient is φ = 85627279906560.
The previous prime is 100022130012991. The next prime is 100022130013021. The reversal of 100022130013001 is 100310031220001.
It can be written as a sum of positive squares in 2 ways, for example, as 42001079718976 + 58021050294025 = 6480824^2 + 7617155^2 .
It is not a de Polignac number, because 100022130013001 - 222 = 100022125818697 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100022130013021) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1261559840 + ... + 1261639121.
It is an arithmetic number, because the mean of its divisors is an integer number (9708008006295).
Almost surely, 2100022130013001 is an apocalyptic number.
It is an amenable number.
100022130013001 is a deficient number, since it is larger than the sum of its proper divisors (16473966062539).
100022130013001 is an equidigital number, since it uses as much as digits as its factorization.
100022130013001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2523199784 (or 2523199777 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 100022130013001 its reverse (100310031220001), we get a palindrome (200332161233002).
The spelling of 100022130013001 in words is "one hundred trillion, twenty-two billion, one hundred thirty million, thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •