Base | Representation |
---|---|
bin | 10010101010101110… |
… | …10010000000001001 |
3 | 221212110100110222222 |
4 | 21111113102000021 |
5 | 131011124213001 |
6 | 4334252223425 |
7 | 503233311233 |
oct | 112527220011 |
9 | 27773313888 |
10 | 10022101001 |
11 | 428323a900 |
12 | 1b3846ab75 |
13 | c39457ca3 |
14 | 6b1077253 |
15 | 3d9cc661b |
hex | 2555d2009 |
10022101001 has 24 divisors (see below), whose sum is σ = 11688963552. Its totient is φ = 8556732800.
The previous prime is 10022100971. The next prime is 10022101007. The reversal of 10022101001 is 10010122001.
It is not a de Polignac number, because 10022101001 - 214 = 10022084617 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10022101001.
It is not an unprimeable number, because it can be changed into a prime (10022101007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1005026 + ... + 1014948.
It is an arithmetic number, because the mean of its divisors is an integer number (487040148).
Almost surely, 210022101001 is an apocalyptic number.
10022101001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10022101001 is a deficient number, since it is larger than the sum of its proper divisors (1666862551).
10022101001 is a wasteful number, since it uses less digits than its factorization.
10022101001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10453 (or 10442 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 10022101001 its reverse (10010122001), we get a palindrome (20032223002).
The spelling of 10022101001 in words is "ten billion, twenty-two million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •