Base | Representation |
---|---|
bin | 1011100111000100001110… |
… | …0111100011011101110010 |
3 | 1200012101200222001211000010 |
4 | 2321301003213203131302 |
5 | 3133123302433333231 |
6 | 43052303410035350 |
7 | 2455203601135515 |
oct | 271610347433562 |
9 | 50171628054003 |
10 | 12765777246066 |
11 | 4081a324a7a89 |
12 | 1522114b78b56 |
13 | 717a6648c6b0 |
14 | 321c1cb5cd7c |
15 | 172101a12546 |
hex | b9c439e3772 |
12765777246066 has 256 divisors, whose sum is σ = 29715691622400. Its totient is φ = 3621252096000.
The previous prime is 12765777245971. The next prime is 12765777246097. The reversal of 12765777246066 is 66064277756721.
It is a super-2 number, since 2×127657772460662 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12765777245988 and 12765777246006.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 8749675245 + ... + 8749676703.
It is an arithmetic number, because the mean of its divisors is an integer number (116076920400).
Almost surely, 212765777246066 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12765777246066, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14857845811200).
12765777246066 is an abundant number, since it is smaller than the sum of its proper divisors (16949914376334).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12765777246066 is a wasteful number, since it uses less digits than its factorization.
12765777246066 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2225.
The product of its (nonzero) digits is 248935680, while the sum is 66.
The spelling of 12765777246066 in words is "twelve trillion, seven hundred sixty-five billion, seven hundred seventy-seven million, two hundred forty-six thousand, sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •