Base | Representation |
---|---|
bin | 11100111000100010… |
… | …011011010101001101 |
3 | 2222001101000220002222 |
4 | 130320202123111031 |
5 | 1002003402220023 |
6 | 22125231025125 |
7 | 2145352604414 |
oct | 347042332515 |
9 | 88041026088 |
10 | 31013320013 |
11 | 12175235395 |
12 | 601636b1a5 |
13 | 2c032b7040 |
14 | 1702c6247b |
15 | c17a8bcc8 |
hex | 73889b54d |
31013320013 has 4 divisors (see below), whose sum is σ = 33398960028. Its totient is φ = 28627680000.
The previous prime is 31013320003. The next prime is 31013320067. The reversal of 31013320013 is 31002331013.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1457865124 + 29555454889 = 38182^2 + 171917^2 .
It is a cyclic number.
It is not a de Polignac number, because 31013320013 - 222 = 31009125709 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31013319973 and 31013320000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31013320003) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1192819988 + ... + 1192820013.
It is an arithmetic number, because the mean of its divisors is an integer number (8349740007).
Almost surely, 231013320013 is an apocalyptic number.
It is an amenable number.
31013320013 is a deficient number, since it is larger than the sum of its proper divisors (2385640015).
31013320013 is a wasteful number, since it uses less digits than its factorization.
31013320013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2385640014.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 31013320013 its reverse (31002331013), we get a palindrome (62015651026).
The spelling of 31013320013 in words is "thirty-one billion, thirteen million, three hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •