Base | Representation |
---|---|
bin | 1001000110001100010110… |
… | …1010100011101111100101 |
3 | 1022102011220120211112121211 |
4 | 2101203011222203233211 |
5 | 2302333044013224333 |
6 | 33134504434511421 |
7 | 2051422613242153 |
oct | 221430552435745 |
9 | 38364816745554 |
10 | 10002000133093 |
11 | 3206908361681 |
12 | 1156555735571 |
13 | 57725264b327 |
14 | 268156a203d3 |
15 | 12529582eecd |
hex | 918c5aa3be5 |
10002000133093 has 2 divisors, whose sum is σ = 10002000133094. Its totient is φ = 10002000133092.
The previous prime is 10002000133087. The next prime is 10002000133109. The reversal of 10002000133093 is 39033100020001.
10002000133093 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9538813719009 + 463186414084 = 3088497^2 + 680578^2 .
It is a cyclic number.
It is not a de Polignac number, because 10002000133093 - 25 = 10002000133061 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10002000139093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5001000066546 + 5001000066547.
It is an arithmetic number, because the mean of its divisors is an integer number (5001000066547).
Almost surely, 210002000133093 is an apocalyptic number.
It is an amenable number.
10002000133093 is a deficient number, since it is larger than the sum of its proper divisors (1).
10002000133093 is an equidigital number, since it uses as much as digits as its factorization.
10002000133093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 10002000133093 its reverse (39033100020001), we get a palindrome (49035100153094).
The spelling of 10002000133093 in words is "ten trillion, two billion, one hundred thirty-three thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •