Base | Representation |
---|---|
bin | 11101010010110100… |
… | …101001001101001111 |
3 | 10000012002211011010020 |
4 | 131102310221031033 |
5 | 1003404300144210 |
6 | 22241102513223 |
7 | 2162316110310 |
oct | 352264511517 |
9 | 100162734106 |
10 | 31454303055 |
11 | 1238115248a |
12 | 6119b95813 |
13 | 2c73777756 |
14 | 1745654607 |
15 | c41648770 |
hex | 752d2934f |
31454303055 has 16 divisors (see below), whose sum is σ = 57516440064. Its totient is φ = 14379109920.
The previous prime is 31454303051. The next prime is 31454303059. The reversal of 31454303055 is 55030345413.
It is an interprime number because it is at equal distance from previous prime (31454303051) and next prime (31454303059).
It is not a de Polignac number, because 31454303055 - 22 = 31454303051 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31454303051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 149782291 + ... + 149782500.
It is an arithmetic number, because the mean of its divisors is an integer number (3594777504).
Almost surely, 231454303055 is an apocalyptic number.
31454303055 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
31454303055 is a deficient number, since it is larger than the sum of its proper divisors (26062137009).
31454303055 is a wasteful number, since it uses less digits than its factorization.
31454303055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 299564806.
The product of its (nonzero) digits is 54000, while the sum is 33.
Adding to 31454303055 its reverse (55030345413), we get a palindrome (86484648468).
The spelling of 31454303055 in words is "thirty-one billion, four hundred fifty-four million, three hundred three thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •