Base | Representation |
---|---|
bin | 1001101001100111110011… |
… | …1000001000011010101001 |
3 | 1101120100222102212102001101 |
4 | 2122121330320020122221 |
5 | 2342321120030413231 |
6 | 34322245532321401 |
7 | 2143411103342356 |
oct | 232317470103251 |
9 | 41510872772041 |
10 | 10610664310441 |
11 | 3420a59424918 |
12 | 1234502013261 |
13 | 5bc7732c79a0 |
14 | 2897b785d62d |
15 | 13601b141661 |
hex | 9a67ce086a9 |
10610664310441 has 16 divisors (see below), whose sum is σ = 12353372180800. Its totient is φ = 9028178751168.
The previous prime is 10610664310423. The next prime is 10610664310451. The reversal of 10610664310441 is 14401346601601.
It is a cyclic number.
It is not a de Polignac number, because 10610664310441 - 27 = 10610664310313 is a prime.
It is a super-2 number, since 2×106106643104412 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a self number, because there is not a number n which added to its sum of digits gives 10610664310441.
It is not an unprimeable number, because it can be changed into a prime (10610664310451) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 580506471 + ... + 580524748.
It is an arithmetic number, because the mean of its divisors is an integer number (772085761300).
Almost surely, 210610664310441 is an apocalyptic number.
It is an amenable number.
10610664310441 is a deficient number, since it is larger than the sum of its proper divisors (1742707870359).
10610664310441 is a wasteful number, since it uses less digits than its factorization.
10610664310441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1161031288.
The product of its (nonzero) digits is 41472, while the sum is 37.
The spelling of 10610664310441 in words is "ten trillion, six hundred ten billion, six hundred sixty-four million, three hundred ten thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •