Base | Representation |
---|---|
bin | 10110111101110000100000… |
… | …110010110000110111100101 |
3 | 111020121121020102111122220102 |
4 | 112331300200302300313211 |
5 | 101214300022241023023 |
6 | 554451115214313445 |
7 | 30163036651200263 |
oct | 2675604062606745 |
9 | 436547212448812 |
10 | 101001001111013 |
11 | 2a200314044643 |
12 | b3b2806ab8885 |
13 | 444847994a563 |
14 | 1ad26901b5433 |
15 | ba2403d86628 |
hex | 5bdc20cb0de5 |
101001001111013 has 2 divisors, whose sum is σ = 101001001111014. Its totient is φ = 101001001111012.
The previous prime is 101001001110983. The next prime is 101001001111019. The reversal of 101001001111013 is 310111100100101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 61713703621249 + 39287297489764 = 7855807^2 + 6267958^2 .
It is a cyclic number.
It is not a de Polignac number, because 101001001111013 - 214 = 101001001094629 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101001001110985 and 101001001111003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101001001111019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50500500555506 + 50500500555507.
It is an arithmetic number, because the mean of its divisors is an integer number (50500500555507).
Almost surely, 2101001001111013 is an apocalyptic number.
It is an amenable number.
101001001111013 is a deficient number, since it is larger than the sum of its proper divisors (1).
101001001111013 is an equidigital number, since it uses as much as digits as its factorization.
101001001111013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3, while the sum is 11.
Adding to 101001001111013 its reverse (310111100100101), we get a palindrome (411112101211114).
The spelling of 101001001111013 in words is "one hundred one trillion, one billion, one million, one hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •