Base | Representation |
---|---|
bin | 1001101100100101011010… |
… | …0011110100111010000011 |
3 | 1101202020100112002020011201 |
4 | 2123021112203310322003 |
5 | 2344134334112422440 |
6 | 34401504210322031 |
7 | 2150162264521255 |
oct | 233112643647203 |
9 | 41666315066151 |
10 | 10661561060995 |
11 | 34405a72aa929 |
12 | 1242347289317 |
13 | 5c44c4a94030 |
14 | 28c045301cd5 |
15 | 1374e95c019a |
hex | 9b2568f4e83 |
10661561060995 has 64 divisors (see below), whose sum is σ = 14028718427136. Its totient is φ = 7730840194560.
The previous prime is 10661561060987. The next prime is 10661561061007. The reversal of 10661561060995 is 59906016516601.
10661561060995 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10661561060995 - 23 = 10661561060987 is a prime.
It is a super-2 number, since 2×106615610609952 (a number of 27 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (55) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2087634232 + ... + 2087639338.
It is an arithmetic number, because the mean of its divisors is an integer number (219198725424).
Almost surely, 210661561060995 is an apocalyptic number.
10661561060995 is a deficient number, since it is larger than the sum of its proper divisors (3367157366141).
10661561060995 is a wasteful number, since it uses less digits than its factorization.
10661561060995 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6940.
The product of its (nonzero) digits is 2624400, while the sum is 55.
The spelling of 10661561060995 in words is "ten trillion, six hundred sixty-one billion, five hundred sixty-one million, sixty thousand, nine hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •