Base | Representation |
---|---|
bin | 11101011001110110101… |
… | …11011011101101101011 |
3 | 10120120210110202000102110 |
4 | 32230323113123231223 |
5 | 113023110202010011 |
6 | 2052044224333403 |
7 | 132664335316233 |
oct | 16547327335553 |
9 | 3516713660373 |
10 | 1010313313131 |
11 | 35a520587781 |
12 | 14397ba74263 |
13 | 7436cb656a5 |
14 | 36c84046cc3 |
15 | 1b431db2ba6 |
hex | eb3b5dbb6b |
1010313313131 has 8 divisors (see below), whose sum is σ = 1362220197840. Its totient is φ = 665974318592.
The previous prime is 1010313313099. The next prime is 1010313313171. The reversal of 1010313313131 is 1313133130101.
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 1010313313131 - 25 = 1010313313099 is a prime.
It is a super-2 number, since 2×10103133131312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1010313313098 and 1010313313107.
It is not an unprimeable number, because it can be changed into a prime (1010313313171) 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, 1891972230 + ... + 1891972763.
It is an arithmetic number, because the mean of its divisors is an integer number (170277524730).
Almost surely, 21010313313131 is an apocalyptic number.
1010313313131 is a deficient number, since it is larger than the sum of its proper divisors (351906884709).
1010313313131 is an equidigital number, since it uses as much as digits as its factorization.
1010313313131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3783945085.
The product of its (nonzero) digits is 243, while the sum is 21.
Adding to 1010313313131 its reverse (1313133130101), we get a palindrome (2323446443232).
The spelling of 1010313313131 in words is "one trillion, ten billion, three hundred thirteen million, three hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •