Base | Representation |
---|---|
bin | 11110000000100111000… |
… | …11000001111010010101 |
3 | 10122120111112101100120212 |
4 | 33000103203001322111 |
5 | 113343213221213023 |
6 | 2105405014135205 |
7 | 134332055150342 |
oct | 17002343017225 |
9 | 3576445340525 |
10 | 1031120101013 |
11 | 368328463442 |
12 | 147a08051505 |
13 | 7630772b9b2 |
14 | 37c995437c9 |
15 | 1bc4d896e78 |
hex | f0138c1e95 |
1031120101013 has 8 divisors (see below), whose sum is σ = 1091783107800. Its totient is φ = 970458081280.
The previous prime is 1031120101007. The next prime is 1031120101031. The reversal of 1031120101013 is 3101010211301.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 300980612689 + 730139488324 = 548617^2 + 854482^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1031120101013 - 28 = 1031120100757 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1031120101073) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3803813 + ... + 4065861.
It is an arithmetic number, because the mean of its divisors is an integer number (136472888475).
Almost surely, 21031120101013 is an apocalyptic number.
It is an amenable number.
1031120101013 is a deficient number, since it is larger than the sum of its proper divisors (60663006787).
1031120101013 is a wasteful number, since it uses less digits than its factorization.
1031120101013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 493527.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 1031120101013 its reverse (3101010211301), we get a palindrome (4132130312314).
The spelling of 1031120101013 in words is "one trillion, thirty-one billion, one hundred twenty million, one hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •