Base | Representation |
---|---|
bin | 101111000010011100… |
… | …1111010011101110101 |
3 | 100122201211200222221021 |
4 | 1132010321322131311 |
5 | 3123334042201010 |
6 | 114223305021141 |
7 | 10204136006611 |
oct | 1360471723565 |
9 | 318654628837 |
10 | 101014022005 |
11 | 39926866916 |
12 | 176b14847b1 |
13 | 96aa919070 |
14 | 4c639bc341 |
15 | 296328a8da |
hex | 1784e7a775 |
101014022005 has 8 divisors (see below), whose sum is σ = 130541197752. Its totient is φ = 74594970048.
The previous prime is 101014021993. The next prime is 101014022027. The reversal of 101014022005 is 500220410101.
It can be written as a sum of positive squares in 4 ways, for example, as 22107526596 + 78906495409 = 148686^2 + 280903^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101014022005 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 101014022005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 777030874 + ... + 777031003.
It is an arithmetic number, because the mean of its divisors is an integer number (16317649719).
Almost surely, 2101014022005 is an apocalyptic number.
It is an amenable number.
101014022005 is a deficient number, since it is larger than the sum of its proper divisors (29527175747).
101014022005 is a wasteful number, since it uses less digits than its factorization.
101014022005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1554061895.
The product of its (nonzero) digits is 80, while the sum is 16.
Adding to 101014022005 its reverse (500220410101), we get a palindrome (601234432106).
The spelling of 101014022005 in words is "one hundred one billion, fourteen million, twenty-two thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •