Base | Representation |
---|---|
bin | 101111000110100001001110… |
… | …0000110100010010000100111 |
3 | 2000022221212120121220102221121 |
4 | 1132031002130012202100213 |
5 | 413301043140103401411 |
6 | 4025100244030154411 |
7 | 153161036056232401 |
oct | 13615023406422047 |
9 | 2008855517812847 |
10 | 414312344200231 |
11 | 110015973222954 |
12 | 3a574611952a07 |
13 | 14a2464286a499 |
14 | 7444b78433b71 |
15 | 32d733529b571 |
hex | 178d09c1a2427 |
414312344200231 has 2 divisors, whose sum is σ = 414312344200232. Its totient is φ = 414312344200230.
The previous prime is 414312344200229. The next prime is 414312344200277. The reversal of 414312344200231 is 132002443213414.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 414312344200231 - 21 = 414312344200229 is a prime.
It is a super-2 number, since 2×4143123442002312 (a number of 30 digits) contains 22 as substring.
Together with 414312344200229, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (414312314200231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 207156172100115 + 207156172100116.
It is an arithmetic number, because the mean of its divisors is an integer number (207156172100116).
Almost surely, 2414312344200231 is an apocalyptic number.
414312344200231 is a deficient number, since it is larger than the sum of its proper divisors (1).
414312344200231 is an equidigital number, since it uses as much as digits as its factorization.
414312344200231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 55296, while the sum is 34.
Adding to 414312344200231 its reverse (132002443213414), we get a palindrome (546314787413645).
The spelling of 414312344200231 in words is "four hundred fourteen trillion, three hundred twelve billion, three hundred forty-four million, two hundred thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •