Base | Representation |
---|---|
bin | 10110111110001011110011… |
… | …111011001000001011101101 |
3 | 111020201101220020011222121122 |
4 | 112332023303323020023231 |
5 | 101220240040123200023 |
6 | 554512403552110325 |
7 | 30165125225040203 |
oct | 2676136373101355 |
9 | 436641806158548 |
10 | 101030313100013 |
11 | 2a211795987840 |
12 | b3b84275353a5 |
13 | 444b16b61024b |
14 | 1ad3c710c7073 |
15 | ba306c3aa2c8 |
hex | 5be2f3ec82ed |
101030313100013 has 16 divisors (see below), whose sum is σ = 111725561889600. Its totient is φ = 90586863319680.
The previous prime is 101030313100001. The next prime is 101030313100033. The reversal of 101030313100013 is 310001313030101.
It is a cyclic number.
It is not a de Polignac number, because 101030313100013 - 26 = 101030313099949 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101030313099964 and 101030313100000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101030313100033) 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, 119272343 + ... + 120116411.
It is an arithmetic number, because the mean of its divisors is an integer number (6982847618100).
Almost surely, 2101030313100013 is an apocalyptic number.
It is an amenable number.
101030313100013 is a deficient number, since it is larger than the sum of its proper divisors (10695248789587).
101030313100013 is a wasteful number, since it uses less digits than its factorization.
101030313100013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 993212.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 101030313100013 its reverse (310001313030101), we get a palindrome (411031626130114).
The spelling of 101030313100013 in words is "one hundred one trillion, thirty billion, three hundred thirteen million, one hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •