Base | Representation |
---|---|
bin | 1001101100100011010111… |
… | …0101110010111101000101 |
3 | 1101202011221021011022102221 |
4 | 2123020311311302331011 |
5 | 2344132223100422321 |
6 | 34401333520532341 |
7 | 2150142550603300 |
oct | 233106565627505 |
9 | 41664837138387 |
10 | 10661012123461 |
11 | 3440345458a47 |
12 | 12422134810b1 |
13 | 5c443813631b |
14 | 28bdd244bb37 |
15 | 1374b62dbe41 |
hex | 9b235d72f45 |
10661012123461 has 12 divisors (see below), whose sum is σ = 12401713019340. Its totient is φ = 9137916453120.
The previous prime is 10661012123459. The next prime is 10661012123467. The reversal of 10661012123461 is 16432121016601.
It can be written as a sum of positive squares in 2 ways, for example, as 1417016448225 + 9243995675236 = 1190385^2 + 3040394^2 .
It is not a de Polignac number, because 10661012123461 - 21 = 10661012123459 is a prime.
It is a super-2 number, since 2×106610121234612 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10661012123467) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3926775 + ... + 6061483.
It is an arithmetic number, because the mean of its divisors is an integer number (1033476084945).
Almost surely, 210661012123461 is an apocalyptic number.
It is an amenable number.
10661012123461 is a deficient number, since it is larger than the sum of its proper divisors (1740700895879).
10661012123461 is a wasteful number, since it uses less digits than its factorization.
10661012123461 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2236644 (or 2236637 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 34.
The spelling of 10661012123461 in words is "ten trillion, six hundred sixty-one billion, twelve million, one hundred twenty-three thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •