Base | Representation |
---|---|
bin | 11101010000111110… |
… | …111101111100111001 |
3 | 10000002221202220120220 |
4 | 131100332331330321 |
5 | 1003323401030113 |
6 | 22234041410253 |
7 | 2161462650345 |
oct | 352076757471 |
9 | 100087686526 |
10 | 31423455033 |
11 | 123657a2953 |
12 | 610b799989 |
13 | 2c6a266799 |
14 | 1741504625 |
15 | c3daa3523 |
hex | 750fbdf39 |
31423455033 has 4 divisors (see below), whose sum is σ = 41897940048. Its totient is φ = 20948970020.
The previous prime is 31423455031. The next prime is 31423455043. The reversal of 31423455033 is 33055432413.
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 a cyclic number.
It is not a de Polignac number, because 31423455033 - 21 = 31423455031 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31423454985 and 31423455003.
It is not an unprimeable number, because it can be changed into a prime (31423455031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5237242503 + ... + 5237242508.
It is an arithmetic number, because the mean of its divisors is an integer number (10474485012).
Almost surely, 231423455033 is an apocalyptic number.
It is an amenable number.
31423455033 is a deficient number, since it is larger than the sum of its proper divisors (10474485015).
31423455033 is a wasteful number, since it uses less digits than its factorization.
31423455033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10474485014.
The product of its (nonzero) digits is 64800, while the sum is 33.
Adding to 31423455033 its reverse (33055432413), we get a palindrome (64478887446).
The spelling of 31423455033 in words is "thirty-one billion, four hundred twenty-three million, four hundred fifty-five thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •