Base | Representation |
---|---|
bin | 1011110010111110010… |
… | …01010110000111011110 |
3 | 1102202012200010112000022 |
4 | 11321133021112013132 |
5 | 23120100220224410 |
6 | 510111455032142 |
7 | 41166200310200 |
oct | 5713711260736 |
9 | 1382180115008 |
10 | 405323211230 |
11 | 146995427823 |
12 | 66679b0b652 |
13 | 2c2b6433982 |
14 | 1589115a770 |
15 | a823de6455 |
hex | 5e5f2561de |
405323211230 has 24 divisors (see below), whose sum is σ = 848697173928. Its totient is φ = 138967957968.
The previous prime is 405323211197. The next prime is 405323211257. The reversal of 405323211230 is 32112323504.
It is a happy number.
It is a super-2 number, since 2×4053232112302 (a number of 24 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 405323211230.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 413594624 + ... + 413595603.
It is an arithmetic number, because the mean of its divisors is an integer number (35362382247).
Almost surely, 2405323211230 is an apocalyptic number.
405323211230 is an abundant number, since it is smaller than the sum of its proper divisors (443373962698).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
405323211230 is a wasteful number, since it uses less digits than its factorization.
405323211230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 827190248 (or 827190241 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 26.
Adding to 405323211230 its reverse (32112323504), we get a palindrome (437435534734).
The spelling of 405323211230 in words is "four hundred five billion, three hundred twenty-three million, two hundred eleven thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •