Base | Representation |
---|---|
bin | 1011101100111111110… |
… | …11001100110110011000 |
3 | 1102102221002102022000012 |
4 | 11312133323030312120 |
5 | 23042012423230000 |
6 | 504421253101052 |
7 | 41023533400061 |
oct | 5663773146630 |
9 | 1372832368005 |
10 | 402115055000 |
11 | 14559951353a |
12 | 65b23627788 |
13 | 2bbc489a889 |
14 | 1566904b568 |
15 | a6d7436735 |
hex | 5d9feccd98 |
402115055000 has 80 divisors (see below), whose sum is σ = 942944005080. Its totient is φ = 160711424000.
The previous prime is 402115054967. The next prime is 402115055009. The reversal of 402115055000 is 550511204.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (402115055009) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 6051959 + ... + 6118041.
Almost surely, 2402115055000 is an apocalyptic number.
402115055000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 402115055000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (471472002540).
402115055000 is an abundant number, since it is smaller than the sum of its proper divisors (540828950080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
402115055000 is a wasteful number, since it uses less digits than its factorization.
402115055000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67326 (or 67307 counting only the distinct ones).
The product of its (nonzero) digits is 1000, while the sum is 23.
Adding to 402115055000 its reverse (550511204), we get a palindrome (402665566204).
The spelling of 402115055000 in words is "four hundred two billion, one hundred fifteen million, fifty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •