Base | Representation |
---|---|
bin | 11101010101110110… |
… | …100010111011000101 |
3 | 10000022122110121001011 |
4 | 131111312202323011 |
5 | 1004010303231003 |
6 | 22250120202221 |
7 | 2163504133306 |
oct | 352566427305 |
9 | 100278417034 |
10 | 31505133253 |
11 | 123a790aa10 |
12 | 6133009371 |
13 | 2c811639a9 |
14 | 174c2c67ad |
15 | c45d3946d |
hex | 755da2ec5 |
31505133253 has 4 divisors (see below), whose sum is σ = 34369236288. Its totient is φ = 28641030220.
The previous prime is 31505133239. The next prime is 31505133263. The reversal of 31505133253 is 35233150513.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 31505133253 - 25 = 31505133221 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31505133263) 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, 1432051501 + ... + 1432051522.
It is an arithmetic number, because the mean of its divisors is an integer number (8592309072).
Almost surely, 231505133253 is an apocalyptic number.
It is an amenable number.
31505133253 is a deficient number, since it is larger than the sum of its proper divisors (2864103035).
31505133253 is a wasteful number, since it uses less digits than its factorization.
31505133253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2864103034.
The product of its (nonzero) digits is 20250, while the sum is 31.
Adding to 31505133253 its reverse (35233150513), we get a palindrome (66738283766).
The spelling of 31505133253 in words is "thirty-one billion, five hundred five million, one hundred thirty-three thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •