Base | Representation |
---|---|
bin | 101111000000111110010101… |
… | …1001011101110011111011011 |
3 | 2000020021000110022101102112021 |
4 | 1132001330223023232133123 |
5 | 413201101343033234001 |
6 | 4023314205135355311 |
7 | 153052006323664135 |
oct | 13601745313563733 |
9 | 2006230408342467 |
10 | 413550240524251 |
11 | 10a8517435a8306 |
12 | 3a470982982b37 |
13 | 1499a80ab9929c |
14 | 7419d1d114055 |
15 | 32c25cde4eba1 |
hex | 1781f2b2ee7db |
413550240524251 has 2 divisors, whose sum is σ = 413550240524252. Its totient is φ = 413550240524250.
The previous prime is 413550240524237. The next prime is 413550240524303. The reversal of 413550240524251 is 152425042055314.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 413550240524251 - 227 = 413550106306523 is a prime.
It is a super-2 number, since 2×4135502405242512 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 413550240524198 and 413550240524207.
It is not a weakly prime, because it can be changed into another prime (413550240524231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 206775120262125 + 206775120262126.
It is an arithmetic number, because the mean of its divisors is an integer number (206775120262126).
Almost surely, 2413550240524251 is an apocalyptic number.
413550240524251 is a deficient number, since it is larger than the sum of its proper divisors (1).
413550240524251 is an equidigital number, since it uses as much as digits as its factorization.
413550240524251 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 960000, while the sum is 43.
Adding to 413550240524251 its reverse (152425042055314), we get a palindrome (565975282579565).
The spelling of 413550240524251 in words is "four hundred thirteen trillion, five hundred fifty billion, two hundred forty million, five hundred twenty-four thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •