Base | Representation |
---|---|
bin | 11100111111100111… |
… | …001100111100001101 |
3 | 2222100122101002022122 |
4 | 130333213030330031 |
5 | 1002224243343201 |
6 | 22145111022325 |
7 | 2151323511155 |
oct | 347747147415 |
9 | 88318332278 |
10 | 31132012301 |
11 | 12226233695 |
12 | 604a06a9a5 |
13 | 2c21a73970 |
14 | 171491b765 |
15 | c231d4e1b |
hex | 73f9ccf0d |
31132012301 has 8 divisors (see below), whose sum is σ = 33592657560. Its totient is φ = 28680777792.
The previous prime is 31132012271. The next prime is 31132012309. The reversal of 31132012301 is 10321023113.
It can be written as a sum of positive squares in 4 ways, for example, as 611572900 + 30520439401 = 24730^2 + 174701^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31132012301 is a prime.
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 31132012301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31132012309) 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, 2345810 + ... + 2359043.
It is an arithmetic number, because the mean of its divisors is an integer number (4199082195).
Almost surely, 231132012301 is an apocalyptic number.
It is an amenable number.
31132012301 is a deficient number, since it is larger than the sum of its proper divisors (2460645259).
31132012301 is a wasteful number, since it uses less digits than its factorization.
31132012301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4705375.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 31132012301 its reverse (10321023113), we get a palindrome (41453035414).
The spelling of 31132012301 in words is "thirty-one billion, one hundred thirty-two million, twelve thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •