Base | Representation |
---|---|
bin | 10011000100000010000… |
… | …110100111001100101011 |
3 | 11122020100011200222212222 |
4 | 103010002012213030223 |
5 | 132430340040010011 |
6 | 2441450021024255 |
7 | 163434012636266 |
oct | 23040206471453 |
9 | 4566304628788 |
10 | 1310000313131 |
11 | 465628030494 |
12 | 191a7855508b |
13 | 966bcb942a3 |
14 | 4759378dcdd |
15 | 24121d45ddb |
hex | 131021a732b |
1310000313131 has 8 divisors (see below), whose sum is σ = 1323165716304. Its totient is φ = 1296897454080.
The previous prime is 1310000313107. The next prime is 1310000313151. The reversal of 1310000313131 is 1313130000131.
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 1310000313131 - 230 = 1308926571307 is a prime.
It is a super-2 number, since 2×13100003131312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1310000313101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15593930 + ... + 15677711.
It is an arithmetic number, because the mean of its divisors is an integer number (165395714538).
Almost surely, 21310000313131 is an apocalyptic number.
1310000313131 is a deficient number, since it is larger than the sum of its proper divisors (13165403173).
1310000313131 is a wasteful number, since it uses less digits than its factorization.
1310000313131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31272061.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 1310000313131 its reverse (1313130000131), we get a palindrome (2623130313262).
The spelling of 1310000313131 in words is "one trillion, three hundred ten billion, three hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •