Base | Representation |
---|---|
bin | 1001011110010001000000… |
… | …1001100111100101000000 |
3 | 1100212201101202012100201100 |
4 | 2113210100021213211000 |
5 | 2331122040030242124 |
6 | 34052502324334400 |
7 | 2123333310522501 |
oct | 227442011474500 |
9 | 40781352170640 |
10 | 10415566649664 |
11 | 3356242927740 |
12 | 1202734244400 |
13 | 5a7250832567 |
14 | 28018a89aba8 |
15 | 130ded2821c9 |
hex | 97910267940 |
10415566649664 has 168 divisors, whose sum is σ = 32636374168320. Its totient is φ = 3149642188800.
The previous prime is 10415566649597. The next prime is 10415566649681. The reversal of 10415566649664 is 46694666551401.
It is a super-2 number, since 2×104155666496642 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1319004 + ... + 4750884.
Almost surely, 210415566649664 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10415566649664, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16318187084160).
10415566649664 is an abundant number, since it is smaller than the sum of its proper divisors (22220807518656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10415566649664 is a wasteful number, since it uses less digits than its factorization.
10415566649664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3432389 (or 3432376 counting only the distinct ones).
The product of its (nonzero) digits is 111974400, while the sum is 63.
The spelling of 10415566649664 in words is "ten trillion, four hundred fifteen billion, five hundred sixty-six million, six hundred forty-nine thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •