Base | Representation |
---|---|
bin | 11101010001100011… |
… | …100010100011001101 |
3 | 10000010121210222121101 |
4 | 131101203202203031 |
5 | 1003333324322000 |
6 | 22235023103101 |
7 | 2161640310142 |
oct | 352143424315 |
9 | 100117728541 |
10 | 31433042125 |
11 | 12370150871 |
12 | 6112a41a91 |
13 | 2c6c242414 |
14 | 17428bc3c9 |
15 | c3e848e6a |
hex | 7518e28cd |
31433042125 has 32 divisors (see below), whose sum is σ = 39442620672. Its totient is φ = 25009560000.
The previous prime is 31433042119. The next prime is 31433042167. The reversal of 31433042125 is 52124033413.
It is a happy number.
It is not a de Polignac number, because 31433042125 - 23 = 31433042117 is a prime.
It is a super-2 number, since 2×314330421252 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31433042093 and 31433042102.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 31527127 + ... + 31528123.
It is an arithmetic number, because the mean of its divisors is an integer number (1232581896).
Almost surely, 231433042125 is an apocalyptic number.
It is an amenable number.
31433042125 is a deficient number, since it is larger than the sum of its proper divisors (8009578547).
31433042125 is an equidigital number, since it uses as much as digits as its factorization.
31433042125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2134 (or 2124 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 28.
Adding to 31433042125 its reverse (52124033413), we get a palindrome (83557075538).
The spelling of 31433042125 in words is "thirty-one billion, four hundred thirty-three million, forty-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •