Base | Representation |
---|---|
bin | 1110010010101110111111… |
… | …11101010110010011011001 |
3 | 11010021200102001021102102022 |
4 | 13021113133331112103121 |
5 | 13104422201433344022 |
6 | 150502431411344225 |
7 | 6422513343261401 |
oct | 711273775262331 |
9 | 133250361242368 |
10 | 31430033106137 |
11 | a018447344516 |
12 | 36374265b2075 |
13 | 146cabb22cc33 |
14 | 7a931657b801 |
15 | 397879901c42 |
hex | 1c95dff564d9 |
31430033106137 has 2 divisors, whose sum is σ = 31430033106138. Its totient is φ = 31430033106136.
The previous prime is 31430033106133. The next prime is 31430033106179. The reversal of 31430033106137 is 73160133003413.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 31231879925401 + 198153180736 = 5588549^2 + 445144^2 .
It is a cyclic number.
It is not a de Polignac number, because 31430033106137 - 22 = 31430033106133 is a prime.
It is a super-3 number, since 3×314300331061373 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 31430033106097 and 31430033106106.
It is not a weakly prime, because it can be changed into another prime (31430033106133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15715016553068 + 15715016553069.
It is an arithmetic number, because the mean of its divisors is an integer number (15715016553069).
Almost surely, 231430033106137 is an apocalyptic number.
It is an amenable number.
31430033106137 is a deficient number, since it is larger than the sum of its proper divisors (1).
31430033106137 is an equidigital number, since it uses as much as digits as its factorization.
31430033106137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 40824, while the sum is 35.
The spelling of 31430033106137 in words is "thirty-one trillion, four hundred thirty billion, thirty-three million, one hundred six thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •