Base | Representation |
---|---|
bin | 1110111100011011000111… |
… | …0001110011011011000001 |
3 | 2011011210212211212002112222 |
4 | 3233012301301303123001 |
5 | 4123202131011430423 |
6 | 54540223133500425 |
7 | 3314055155030552 |
oct | 357066161633301 |
9 | 64153784762488 |
10 | 16431232530113 |
11 | 52654a0446a25 |
12 | 1a14596641715 |
13 | 9225c66626ab |
14 | 40b3c10c6329 |
15 | 1d76327123c8 |
hex | ef1b1c736c1 |
16431232530113 has 2 divisors, whose sum is σ = 16431232530114. Its totient is φ = 16431232530112.
The previous prime is 16431232530101. The next prime is 16431232530131. The reversal of 16431232530113 is 31103523213461.
Together with next prime (16431232530131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15685940460304 + 745292069809 = 3960548^2 + 863303^2 .
It is a cyclic number.
It is not a de Polignac number, because 16431232530113 - 212 = 16431232526017 is a prime.
It is not a weakly prime, because it can be changed into another prime (16431232530173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8215616265056 + 8215616265057.
It is an arithmetic number, because the mean of its divisors is an integer number (8215616265057).
Almost surely, 216431232530113 is an apocalyptic number.
It is an amenable number.
16431232530113 is a deficient number, since it is larger than the sum of its proper divisors (1).
16431232530113 is an equidigital number, since it uses as much as digits as its factorization.
16431232530113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 38880, while the sum is 35.
Adding to 16431232530113 its reverse (31103523213461), we get a palindrome (47534755743574).
The spelling of 16431232530113 in words is "sixteen trillion, four hundred thirty-one billion, two hundred thirty-two million, five hundred thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •