Base | Representation |
---|---|
bin | 10000000010110001000… |
… | …111101001100001000000 |
3 | 10220101200221122101211111 |
4 | 100002301013221201000 |
5 | 121030341144400224 |
6 | 2202250201053104 |
7 | 142436363402611 |
oct | 20026107514100 |
9 | 3811627571744 |
10 | 1102483200064 |
11 | 39561902aa54 |
12 | 159803487194 |
13 | 7cc6b3a4a1c |
14 | 3b5091c3c08 |
15 | 1da289add94 |
hex | 100b11e9840 |
1102483200064 has 21 divisors (see below), whose sum is σ = 2187756768877. Its totient is φ = 551237400064.
The previous prime is 1102483200037. The next prime is 1102483200131. The reversal of 1102483200064 is 4600023842011.
The square root of 1102483200064 is 1049992.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 509213542464 + 593269657600 = 713592^2 + 770240^2 .
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1102483199999 and 1102483200035.
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 2 ways as a sum of consecutive naturals, for example, 8334312 + ... + 8465560.
Almost surely, 21102483200064 is an apocalyptic number.
1102483200064 is the 1049992-nd square number.
It is an amenable number.
1102483200064 is a deficient number, since it is larger than the sum of its proper divisors (1085273568813).
1102483200064 is an frugal number, since it uses more digits than its factorization.
1102483200064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 262510 (or 131251 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 31.
The spelling of 1102483200064 in words is "one trillion, one hundred two billion, four hundred eighty-three million, two hundred thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •