Base | Representation |
---|---|
bin | 1100000001010101010… |
… | …00110101111111100001 |
3 | 1110111002220222020211010 |
4 | 12000222220311333201 |
5 | 23231342221213101 |
6 | 513424441411133 |
7 | 41561215601346 |
oct | 6005250657741 |
9 | 1414086866733 |
10 | 413032210401 |
11 | 14a190a07a18 |
12 | 6806b799aa9 |
13 | 2cc445aa145 |
14 | 15dc2d147cd |
15 | ab25aae2d6 |
hex | 602aa35fe1 |
413032210401 has 12 divisors (see below), whose sum is σ = 560201893712. Its totient is φ = 270687769464.
The previous prime is 413032210399. The next prime is 413032210403. The reversal of 413032210401 is 104012230314.
It is an interprime number because it is at equal distance from previous prime (413032210399) and next prime (413032210403).
It is not a de Polignac number, because 413032210401 - 21 = 413032210399 is a prime.
It is a super-3 number, since 3×4130322104013 (a number of 36 digits) contains 333 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (413032210403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 19765111 + ... + 19785996.
Almost surely, 2413032210401 is an apocalyptic number.
It is an amenable number.
413032210401 is a deficient number, since it is larger than the sum of its proper divisors (147169683311).
413032210401 is an equidigital number, since it uses as much as digits as its factorization.
413032210401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39551228 (or 39551169 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 413032210401 its reverse (104012230314), we get a palindrome (517044440715).
The spelling of 413032210401 in words is "four hundred thirteen billion, thirty-two million, two hundred ten thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •