Base | Representation |
---|---|
bin | 11101000101000011… |
… | …011110011100111101 |
3 | 2222121000011111102010 |
4 | 131011003132130331 |
5 | 1002421131411031 |
6 | 22202131521433 |
7 | 2153512520502 |
oct | 350503363475 |
9 | 88530144363 |
10 | 31223310141 |
11 | 12272821051 |
12 | 6074759279 |
13 | 2c3795b55a |
14 | 1722ac54a9 |
15 | c2b21b246 |
hex | 7450de73d |
31223310141 has 8 divisors (see below), whose sum is σ = 41633020384. Its totient is φ = 20814570000.
The previous prime is 31223310119. The next prime is 31223310163. The reversal of 31223310141 is 14101332213.
It is an interprime number because it is at equal distance from previous prime (31223310119) and next prime (31223310163).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31223310141 - 26 = 31223310077 is a prime.
It is a super-2 number, since 2×312233101412 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31223310841) 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, 163771 + ... + 298776.
It is an arithmetic number, because the mean of its divisors is an integer number (5204127548).
Almost surely, 231223310141 is an apocalyptic number.
It is an amenable number.
31223310141 is a deficient number, since it is larger than the sum of its proper divisors (10409710243).
31223310141 is a wasteful number, since it uses less digits than its factorization.
31223310141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 485051.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 31223310141 its reverse (14101332213), we get a palindrome (45324642354).
The spelling of 31223310141 in words is "thirty-one billion, two hundred twenty-three million, three hundred ten thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •