Base | Representation |
---|---|
bin | 10111110011000100010111… |
… | …111110001101001101011001 |
3 | 111201120211021012010200222221 |
4 | 113303010113332031031121 |
5 | 102204310303304003400 |
6 | 1010334104513144041 |
7 | 31021520615625604 |
oct | 2763042776151531 |
9 | 451524235120887 |
10 | 104664460219225 |
11 | 30392a48219095 |
12 | b8a480bb5b021 |
13 | 4652a7c3b4a1a |
14 | 1bbbb0339b33b |
15 | c178696cbc1a |
hex | 5f3117f8d359 |
104664460219225 has 27 divisors (see below), whose sum is σ = 131754230104287. Its totient is φ = 82479142408080.
The previous prime is 104664460219219. The next prime is 104664460219237. The reversal of 104664460219225 is 522912064466401.
The square root of 104664460219225 is 10230565.
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., 37679205678921 + 66985254540304 = 6138339^2 + 8184452^2 .
It is not a de Polignac number, because 104664460219225 - 227 = 104664326001497 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 3427224006 + ... + 3427254544.
Almost surely, 2104664460219225 is an apocalyptic number.
104664460219225 is the 10230565-th square number.
104664460219225 is the 5115283-rd centered octagonal number.
It is an amenable number.
104664460219225 is a deficient number, since it is larger than the sum of its proper divisors (27089769885062).
104664460219225 is an frugal number, since it uses more digits than its factorization.
104664460219225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61222 (or 30611 counting only the distinct ones).
The product of its (nonzero) digits is 4976640, while the sum is 52.
The spelling of 104664460219225 in words is "one hundred four trillion, six hundred sixty-four billion, four hundred sixty million, two hundred nineteen thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •