Base | Representation |
---|---|
bin | 11101010010000011… |
… | …011101100001010101 |
3 | 10000011012120010100121 |
4 | 131102003131201111 |
5 | 1003343000111013 |
6 | 22235522311541 |
7 | 2162101401520 |
oct | 352203354125 |
9 | 100135503317 |
10 | 31441410133 |
11 | 12374946881 |
12 | 61157b85b1 |
13 | 2c70bb21c3 |
14 | 1743a59bb7 |
15 | c4044d58d |
hex | 7520dd855 |
31441410133 has 8 divisors (see below), whose sum is σ = 36522106880. Its totient is φ = 26507980080.
The previous prime is 31441410061. The next prime is 31441410149. The reversal of 31441410133 is 33101414413.
It is a happy number.
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 31441410133 - 29 = 31441409621 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31441410098 and 31441410107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31441416133) 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, 36816213 + ... + 36817066.
It is an arithmetic number, because the mean of its divisors is an integer number (4565263360).
Almost surely, 231441410133 is an apocalyptic number.
It is an amenable number.
31441410133 is a deficient number, since it is larger than the sum of its proper divisors (5080696747).
31441410133 is an equidigital number, since it uses as much as digits as its factorization.
31441410133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73633347.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 31441410133 its reverse (33101414413), we get a palindrome (64542824546).
The spelling of 31441410133 in words is "thirty-one billion, four hundred forty-one million, four hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •