Base | Representation |
---|---|
bin | 111100001101001… |
… | …110101100010001 |
3 | 2121101200110002111 |
4 | 330031032230101 |
5 | 4032041213014 |
6 | 244121545321 |
7 | 34013500621 |
oct | 7415165421 |
9 | 2541613074 |
10 | 1010101009 |
11 | 4791a2925 |
12 | 242345241 |
13 | 131365a08 |
14 | 9821a881 |
15 | 5da292c4 |
hex | 3c34eb11 |
1010101009 has 8 divisors (see below), whose sum is σ = 1063592480. Its totient is φ = 956642400.
The previous prime is 1010101007. The next prime is 1010101039. The reversal of 1010101009 is 9001010101.
1010101009 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1010101009 - 21 = 1010101007 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 1010101009.
It is not an unprimeable number, because it can be changed into a prime (1010101007) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 78394 + ... + 90364.
It is an arithmetic number, because the mean of its divisors is an integer number (132949060).
Almost surely, 21010101009 is an apocalyptic number.
1010101009 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
1010101009 is a deficient number, since it is larger than the sum of its proper divisors (53491471).
1010101009 is a wasteful number, since it uses less digits than its factorization.
1010101009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16431.
The product of its (nonzero) digits is 9, while the sum is 13.
The square root of 1010101009 is about 31782.0862908652. The cubic root of 1010101009 is about 1003.3557294834.
The spelling of 1010101009 in words is "one billion, ten million, one hundred one thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •