Base | Representation |
---|---|
bin | 1110010001110111011101… |
… | …11101110011011001000011 |
3 | 11010011211110022212102110222 |
4 | 13020323232331303121003 |
5 | 13103430122322044301 |
6 | 150441021215413255 |
7 | 6420406504101431 |
oct | 710735675633103 |
9 | 133154408772428 |
10 | 31400220112451 |
11 | a006838719063 |
12 | 36316a622422b |
13 | 146a049822a78 |
14 | 7a7ac8cd1d51 |
15 | 396bd241731b |
hex | 1c8eeef73643 |
31400220112451 has 2 divisors, whose sum is σ = 31400220112452. Its totient is φ = 31400220112450.
The previous prime is 31400220112379. The next prime is 31400220112463. The reversal of 31400220112451 is 15421102200413.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31400220112451 is a prime.
It is a super-2 number, since 2×314002201124512 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 31400220112451.
It is not a weakly prime, because it can be changed into another prime (31400220102451) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15700110056225 + 15700110056226.
It is an arithmetic number, because the mean of its divisors is an integer number (15700110056226).
Almost surely, 231400220112451 is an apocalyptic number.
31400220112451 is a deficient number, since it is larger than the sum of its proper divisors (1).
31400220112451 is an equidigital number, since it uses as much as digits as its factorization.
31400220112451 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1920, while the sum is 26.
Adding to 31400220112451 its reverse (15421102200413), we get a palindrome (46821322312864).
The spelling of 31400220112451 in words is "thirty-one trillion, four hundred billion, two hundred twenty million, one hundred twelve thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •