Base | Representation |
---|---|
bin | 1011110000100101010… |
… | …10011011111001000010 |
3 | 1102121220020121200000000 |
4 | 11320102222123321002 |
5 | 23104433222240002 |
6 | 505340300140430 |
7 | 41122326450204 |
oct | 5702252337102 |
9 | 1377806550000 |
10 | 404040040002 |
11 | 146397084235 |
12 | 66380237716 |
13 | 2c14063b861 |
14 | 157ac97a774 |
15 | a79b42c61c |
hex | 5e12a9be42 |
404040040002 has 72 divisors (see below), whose sum is σ = 931216945932. Its totient is φ = 131394960000.
The previous prime is 404040039971. The next prime is 404040040013. The reversal of 404040040002 is 200040040404.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 331765632081 + 72274407921 = 575991^2 + 268839^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
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 35 ways as a sum of consecutive naturals, for example, 162502 + ... + 913502.
Almost surely, 2404040040002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 404040040002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (465608472966).
404040040002 is an abundant number, since it is smaller than the sum of its proper divisors (527176905930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
404040040002 is an frugal number, since it uses more digits than its factorization.
404040040002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 751068 (or 751047 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 18.
Adding to 404040040002 its reverse (200040040404), we get a palindrome (604080080406).
The spelling of 404040040002 in words is "four hundred four billion, forty million, forty thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •