Base | Representation |
---|---|
bin | 1011101011100011000… |
… | …00001100100100011001 |
3 | 1102100220210220120202112 |
4 | 11311301200030210121 |
5 | 23033414033132100 |
6 | 504212112042105 |
7 | 40665325421612 |
oct | 5656140144431 |
9 | 1370823816675 |
10 | 401336224025 |
11 | 145229921280 |
12 | 65946833335 |
13 | 2bacc41a249 |
14 | 155d3832c09 |
15 | a68dd91b35 |
hex | 5d7180c919 |
401336224025 has 24 divisors (see below), whose sum is σ = 545740927488. Its totient is φ = 290352680000.
The previous prime is 401336224013. The next prime is 401336224039. The reversal of 401336224025 is 520422633104.
It is not a de Polignac number, because 401336224025 - 214 = 401336207641 is a prime.
It is a super-2 number, since 2×4013362240252 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 401336223982 and 401336224000.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3767906 + ... + 3872955.
It is an arithmetic number, because the mean of its divisors is an integer number (22739205312).
Almost surely, 2401336224025 is an apocalyptic number.
It is an amenable number.
401336224025 is a deficient number, since it is larger than the sum of its proper divisors (144404703463).
401336224025 is a wasteful number, since it uses less digits than its factorization.
401336224025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7641073 (or 7641068 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 32.
Adding to 401336224025 its reverse (520422633104), we get a palindrome (921758857129).
The spelling of 401336224025 in words is "four hundred one billion, three hundred thirty-six million, two hundred twenty-four thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •