Base | Representation |
---|---|
bin | 1001001101110100101111… |
… | …0110000011101000010101 |
3 | 1022212201022011221201111122 |
4 | 2103131023312003220111 |
5 | 2312010042140004414 |
6 | 33315025414413325 |
7 | 2064043446342344 |
oct | 223351366035025 |
9 | 38781264851448 |
10 | 10133100313109 |
11 | 3257472a59294 |
12 | 1177a42961245 |
13 | 586716437747 |
14 | 270632273b5b |
15 | 1288ba062b8e |
hex | 9374bd83a15 |
10133100313109 has 16 divisors (see below), whose sum is σ = 10838304825600. Its totient is φ = 9445913620416.
The previous prime is 10133100313099. The next prime is 10133100313111. The reversal of 10133100313109 is 90131300133101.
10133100313109 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10133100313109 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 (10133100313129) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11080514 + ... + 11960099.
It is an arithmetic number, because the mean of its divisors is an integer number (677394051600).
Almost surely, 210133100313109 is an apocalyptic number.
10133100313109 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
10133100313109 is a deficient number, since it is larger than the sum of its proper divisors (705204512491).
10133100313109 is a wasteful number, since it uses less digits than its factorization.
10133100313109 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23041004.
The product of its (nonzero) digits is 729, while the sum is 26.
The spelling of 10133100313109 in words is "ten trillion, one hundred thirty-three billion, one hundred million, three hundred thirteen thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •