Base | Representation |
---|---|
bin | 101101101000100100011100… |
… | …0100101111111000010110000 |
3 | 1221122020110120100221220122221 |
4 | 1123101020320211333002300 |
5 | 410103014201233444331 |
6 | 3541412340554410424 |
7 | 150356123161225630 |
oct | 13321107045770260 |
9 | 1848213510856587 |
10 | 401400003031216 |
11 | 106997870264322 |
12 | 3902a014a30a14 |
13 | 142c8b1c976537 |
14 | 7119c144026c0 |
15 | 316150668b711 |
hex | 16d123897f0b0 |
401400003031216 has 80 divisors (see below), whose sum is σ = 897206584103424. Its totient is φ = 170404565087232.
The previous prime is 401400003031207. The next prime is 401400003031229. The reversal of 401400003031216 is 612130300004104.
It is a super-2 number, since 2×4014000030312162 (a number of 30 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 124394781 + ... + 127580803.
Almost surely, 2401400003031216 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 401400003031216, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (448603292051712).
401400003031216 is an abundant number, since it is smaller than the sum of its proper divisors (495806581072208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
401400003031216 is a wasteful number, since it uses less digits than its factorization.
401400003031216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3196658 (or 3196652 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 25.
The spelling of 401400003031216 in words is "four hundred one trillion, four hundred billion, three million, thirty-one thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •