Base | Representation |
---|---|
bin | 1001011111101101000100… |
… | …0110010100011110100100 |
3 | 1100222002011222010201211011 |
4 | 2113323101012110132210 |
5 | 2332023142311433124 |
6 | 34112110415552004 |
7 | 2125166560036414 |
oct | 227732106243644 |
9 | 40862158121734 |
10 | 10440278624164 |
11 | 3365774118964 |
12 | 120749022b604 |
13 | 5a968b4a148c |
14 | 2814528aa644 |
15 | 131897a0d994 |
hex | 97ed11947a4 |
10440278624164 has 27 divisors (see below), whose sum is σ = 18548020706817. Its totient is φ = 5142013529664.
The previous prime is 10440278624159. The next prime is 10440278624311. The reversal of 10440278624164 is 46142687204401.
The square root of 10440278624164 is 3231142.
It is a perfect power (a square), and thus also a powerful number.
10440278624164 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 6965007156900 + 3475271467264 = 2639130^2 + 1864208^2 .
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 432960972 + ... + 432985084.
Almost surely, 210440278624164 is an apocalyptic number.
10440278624164 is the 3231142-nd square number.
It is an amenable number.
10440278624164 is a deficient number, since it is larger than the sum of its proper divisors (8107742082653).
10440278624164 is an frugal number, since it uses more digits than its factorization.
10440278624164 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48364 (or 24182 counting only the distinct ones).
The product of its (nonzero) digits is 2064384, while the sum is 49.
Multiplying 10440278624164 by its sum of digits (49), we get a square (511573652584036 = 226179942).
The spelling of 10440278624164 in words is "ten trillion, four hundred forty billion, two hundred seventy-eight million, six hundred twenty-four thousand, one hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •