Base | Representation |
---|---|
bin | 11101011001010010011… |
… | …10111100111101000101 |
3 | 10120120000021022101121012 |
4 | 32230221032330331011 |
5 | 113021444312200401 |
6 | 2051554120132005 |
7 | 132653652461621 |
oct | 16545116747505 |
9 | 3516007271535 |
10 | 1010009100101 |
11 | 35a384895a51 |
12 | 1438b6007005 |
13 | 74321b21091 |
14 | 36c55898181 |
15 | 1b4153208bb |
hex | eb293bcf45 |
1010009100101 has 8 divisors (see below), whose sum is σ = 1010700228600. Its totient is φ = 1009318171840.
The previous prime is 1010009100083. The next prime is 1010009100169. The reversal of 1010009100101 is 1010019000101.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 5105102500 + 1004903997601 = 71450^2 + 1002449^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1010009100101 - 222 = 1010004905797 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010009100301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10838615 + ... + 10931403.
It is an arithmetic number, because the mean of its divisors is an integer number (126337528575).
Almost surely, 21010009100101 is an apocalyptic number.
It is an amenable number.
1010009100101 is a deficient number, since it is larger than the sum of its proper divisors (691128499).
1010009100101 is an equidigital number, since it uses as much as digits as its factorization.
1010009100101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100119.
The product of its (nonzero) digits is 9, while the sum is 14.
The spelling of 1010009100101 in words is "one trillion, ten billion, nine million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •