Base | Representation |
---|---|
bin | 10110111101111011111000… |
… | …000001111001000111100001 |
3 | 111020122202201201211210010122 |
4 | 112331323320001321013201 |
5 | 101220000014220103433 |
6 | 554500454024210025 |
7 | 30163651213043522 |
oct | 2675737001710741 |
9 | 436582651753118 |
10 | 101013202112993 |
11 | 2a205505202a55 |
12 | b3b5051009915 |
13 | 444967262a461 |
14 | 1ad30ca796849 |
15 | ba28ba0ad198 |
hex | 5bdef80791e1 |
101013202112993 has 2 divisors, whose sum is σ = 101013202112994. Its totient is φ = 101013202112992.
The previous prime is 101013202112989. The next prime is 101013202113017. The reversal of 101013202112993 is 399211202310101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 99416992231249 + 1596209881744 = 9970807^2 + 1263412^2 .
It is an emirp because it is prime and its reverse (399211202310101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101013202112993 - 22 = 101013202112989 is a prime.
It is a super-2 number, since 2×1010132021129932 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (101013202112393) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50506601056496 + 50506601056497.
It is an arithmetic number, because the mean of its divisors is an integer number (50506601056497).
Almost surely, 2101013202112993 is an apocalyptic number.
It is an amenable number.
101013202112993 is a deficient number, since it is larger than the sum of its proper divisors (1).
101013202112993 is an equidigital number, since it uses as much as digits as its factorization.
101013202112993 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5832, while the sum is 35.
The spelling of 101013202112993 in words is "one hundred one trillion, thirteen billion, two hundred two million, one hundred twelve thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •