Base | Representation |
---|---|
bin | 1011101011100010100… |
… | …00011101101110101101 |
3 | 1102100220112011001200100 |
4 | 11311301100131232231 |
5 | 23033412004200023 |
6 | 504211443421313 |
7 | 40665245364345 |
oct | 5656120355655 |
9 | 1370815131610 |
10 | 401332100013 |
11 | 1452275648a9 |
12 | 65945384839 |
13 | 2bacb6050c0 |
14 | 155d307bd25 |
15 | a68d829c43 |
hex | 5d7141dbad |
401332100013 has 24 divisors (see below), whose sum is σ = 661017579768. Its totient is φ = 232445740032.
The previous prime is 401332100003. The next prime is 401332100041. The reversal of 401332100013 is 310001233104.
It can be written as a sum of positive squares in 4 ways, for example, as 177411967209 + 223920132804 = 421203^2 + 473202^2 .
It is not a de Polignac number, because 401332100013 - 210 = 401332098989 is a prime.
It is a super-2 number, since 2×4013321000132 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (401332100003) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 100885920 + ... + 100889897.
It is an arithmetic number, because the mean of its divisors is an integer number (27542399157).
Almost surely, 2401332100013 is an apocalyptic number.
It is an amenable number.
401332100013 is a deficient number, since it is larger than the sum of its proper divisors (259685479755).
401332100013 is a wasteful number, since it uses less digits than its factorization.
401332100013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 201775853 (or 201775850 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 401332100013 its reverse (310001233104), we get a palindrome (711333333117).
The spelling of 401332100013 in words is "four hundred one billion, three hundred thirty-two million, one hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •