Base | Representation |
---|---|
bin | 1011101101101001100… |
… | …11000000000000000000 |
3 | 1102110211111022212100100 |
4 | 11312310303000000000 |
5 | 23043222044224002 |
6 | 504520122322400 |
7 | 41035314661011 |
oct | 5666463000000 |
9 | 1373744285310 |
10 | 402465226752 |
11 | 145759145786 |
12 | 66000959400 |
13 | 2bc4c2b3cb4 |
14 | 1569d761008 |
15 | a70805611c |
hex | 5db4cc0000 |
402465226752 has 228 divisors, whose sum is σ = 1170397327320. Its totient is φ = 133265620992.
The previous prime is 402465226747. The next prime is 402465226771. The reversal of 402465226752 is 257622564204.
It is a happy number.
402465226752 is a `hidden beast` number, since 40 + 24 + 6 + 522 + 67 + 5 + 2 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 402465226698 and 402465226707.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 422313508 + ... + 422314460.
Almost surely, 2402465226752 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 402465226752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (585198663660).
402465226752 is an abundant number, since it is smaller than the sum of its proper divisors (767932100568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
402465226752 is an frugal number, since it uses more digits than its factorization.
402465226752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1174 (or 1137 counting only the distinct ones).
The product of its (nonzero) digits is 1612800, while the sum is 45.
The spelling of 402465226752 in words is "four hundred two billion, four hundred sixty-five million, two hundred twenty-six thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •