Base | Representation |
---|---|
bin | 1001001011111101001011… |
… | …0111101011101011100101 |
3 | 1022202122110110200212220000 |
4 | 2102333102313223223211 |
5 | 2310443330004100333 |
6 | 33252201004331513 |
7 | 2061526225502106 |
oct | 222772267535345 |
9 | 38678413625800 |
10 | 10101005925093 |
11 | 32448a356a576 |
12 | 1171786543b99 |
13 | 5836a019acc5 |
14 | 26cc69a003ad |
15 | 127b3c62e713 |
hex | 92fd2debae5 |
10101005925093 has 20 divisors (see below), whose sum is σ = 15457185223788. Its totient is φ = 6569759949120.
The previous prime is 10101005924993. The next prime is 10101005925113. The reversal of 10101005925093 is 39052950010101.
10101005925093 is a `hidden beast` number, since 1 + 0 + 1 + 0 + 10 + 0 + 592 + 50 + 9 + 3 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 3856439743524 + 6244566181569 = 1963782^2 + 2498913^2 .
It is not a de Polignac number, because 10101005925093 - 210 = 10101005924069 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10101005925293) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1520774446 + ... + 1520781087.
Almost surely, 210101005925093 is an apocalyptic number.
It is an amenable number.
10101005925093 is a deficient number, since it is larger than the sum of its proper divisors (5356179298695).
10101005925093 is an equidigital number, since it uses as much as digits as its factorization.
10101005925093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3041555586 (or 3041555577 counting only the distinct ones).
The product of its (nonzero) digits is 12150, while the sum is 36.
Adding to 10101005925093 its reverse (39052950010101), we get a palindrome (49153955935194).
The spelling of 10101005925093 in words is "ten trillion, one hundred one billion, five million, nine hundred twenty-five thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •