Base | Representation |
---|---|
bin | 11110000000011010000… |
… | …00001110010001010101 |
3 | 10122120012212210120011022 |
4 | 33000031000032101111 |
5 | 113343002120011201 |
6 | 2105350053050525 |
7 | 134326253031503 |
oct | 17001500162125 |
9 | 3576185716138 |
10 | 1031010313301 |
11 | 3682814972a1 |
12 | 147997326a45 |
13 | 762baa6c157 |
14 | 37c88b25673 |
15 | 1bc43e0c41b |
hex | f00d00e455 |
1031010313301 has 16 divisors (see below), whose sum is σ = 1077133075200. Its totient is φ = 985596140928.
The previous prime is 1031010313273. The next prime is 1031010313309. The reversal of 1031010313301 is 1033130101301.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1031010313301 is a prime.
It is a super-2 number, since 2×10310103133012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1031010313301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1031010313309) 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, 16148720 + ... + 16212438.
It is an arithmetic number, because the mean of its divisors is an integer number (67320817200).
Almost surely, 21031010313301 is an apocalyptic number.
It is an amenable number.
1031010313301 is a deficient number, since it is larger than the sum of its proper divisors (46122761899).
1031010313301 is a wasteful number, since it uses less digits than its factorization.
1031010313301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69268.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 1031010313301 its reverse (1033130101301), we get a palindrome (2064140414602).
The spelling of 1031010313301 in words is "one trillion, thirty-one billion, ten million, three hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •