Base | Representation |
---|---|
bin | 101111000000000110111010… |
… | …1010100000111010000001011 |
3 | 2000012211122020220222010002121 |
4 | 1132000031311110013100023 |
5 | 413142124122114340043 |
6 | 4023143403255112111 |
7 | 153040264112011114 |
oct | 13600156524072013 |
9 | 2005748226863077 |
10 | 413431225152523 |
11 | 10a80621a517a66 |
12 | 3a4518a8972637 |
13 | 1498c5219994c6 |
14 | 741426c87720b |
15 | 32be465640ded |
hex | 178037550740b |
413431225152523 has 2 divisors, whose sum is σ = 413431225152524. Its totient is φ = 413431225152522.
The previous prime is 413431225152371. The next prime is 413431225152559. The reversal of 413431225152523 is 325251522134314.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 413431225152523 - 237 = 413293786199051 is a prime.
It is a super-2 number, since 2×4134312251525232 (a number of 30 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 413431225152523.
It is not a weakly prime, because it can be changed into another prime (413431225152223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 206715612576261 + 206715612576262.
It is an arithmetic number, because the mean of its divisors is an integer number (206715612576262).
Almost surely, 2413431225152523 is an apocalyptic number.
413431225152523 is a deficient number, since it is larger than the sum of its proper divisors (1).
413431225152523 is an equidigital number, since it uses as much as digits as its factorization.
413431225152523 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 864000, while the sum is 43.
Adding to 413431225152523 its reverse (325251522134314), we get a palindrome (738682747286837).
The spelling of 413431225152523 in words is "four hundred thirteen trillion, four hundred thirty-one billion, two hundred twenty-five million, one hundred fifty-two thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •