Base | Representation |
---|---|
bin | 11101101101100101… |
… | …000000110111010011 |
3 | 10001100101110222220112 |
4 | 131231211000313103 |
5 | 1010314204043413 |
6 | 22353420031535 |
7 | 2206406434103 |
oct | 355545006723 |
9 | 101311428815 |
10 | 31903190483 |
11 | 1259157922a |
12 | 62243925ab |
13 | 3015774c08 |
14 | 1789103203 |
15 | c6ac672a8 |
hex | 76d940dd3 |
31903190483 has 2 divisors, whose sum is σ = 31903190484. Its totient is φ = 31903190482.
The previous prime is 31903190441. The next prime is 31903190507. The reversal of 31903190483 is 38409130913.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 31903190483 - 210 = 31903189459 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 31903190483.
It is not a weakly prime, because it can be changed into another prime (31903190383) 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 as a sum of consecutive naturals, namely, 15951595241 + 15951595242.
It is an arithmetic number, because the mean of its divisors is an integer number (15951595242).
Almost surely, 231903190483 is an apocalyptic number.
31903190483 is a deficient number, since it is larger than the sum of its proper divisors (1).
31903190483 is an equidigital number, since it uses as much as digits as its factorization.
31903190483 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 69984, while the sum is 41.
The spelling of 31903190483 in words is "thirty-one billion, nine hundred three million, one hundred ninety thousand, four hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •