Base | Representation |
---|---|
bin | 101111001100100010111000… |
… | …0011011010010101110000101 |
3 | 2000102220001022000122221020221 |
4 | 1132121011300123102232011 |
5 | 413403130311233212404 |
6 | 4030532533055224341 |
7 | 153304625405423662 |
oct | 13631056033225605 |
9 | 2012801260587227 |
10 | 415140540132229 |
11 | 11030512923868a |
12 | 3a689026b180b1 |
13 | 14a8477b1c6392 |
14 | 7472ca338ca69 |
15 | 32edb58b08954 |
hex | 17991706d2b85 |
415140540132229 has 2 divisors, whose sum is σ = 415140540132230. Its totient is φ = 415140540132228.
The previous prime is 415140540132191. The next prime is 415140540132251. The reversal of 415140540132229 is 922231045041514.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 414605872068129 + 534668064100 = 20361873^2 + 731210^2 .
It is a cyclic number.
It is not a de Polignac number, because 415140540132229 - 217 = 415140540001157 is a prime.
It is a super-2 number, since 2×4151405401322292 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (415140540135229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 207570270066114 + 207570270066115.
It is an arithmetic number, because the mean of its divisors is an integer number (207570270066115).
Almost surely, 2415140540132229 is an apocalyptic number.
It is an amenable number.
415140540132229 is a deficient number, since it is larger than the sum of its proper divisors (1).
415140540132229 is an equidigital number, since it uses as much as digits as its factorization.
415140540132229 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 345600, while the sum is 43.
The spelling of 415140540132229 in words is "four hundred fifteen trillion, one hundred forty billion, five hundred forty million, one hundred thirty-two thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •