Base | Representation |
---|---|
bin | 11101111110110000100… |
… | …111111101100001011100 |
3 | 21021221212112202002100010 |
4 | 131332300213331201130 |
5 | 232223344131203122 |
6 | 4214244511203220 |
7 | 301563660105066 |
oct | 35766047754134 |
9 | 7257775662303 |
10 | 2060252600412 |
11 | 724825978316 |
12 | 29335a516510 |
13 | 11c386434756 |
14 | 71a06ad8736 |
15 | 388d29c9e0c |
hex | 1dfb09fd85c |
2060252600412 has 96 divisors (see below), whose sum is σ = 5119545150720. Its totient is φ = 642608501760.
The previous prime is 2060252600407. The next prime is 2060252600479. The reversal of 2060252600412 is 2140062520602.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 2060252600412.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 235533823 + ... + 235542569.
It is an arithmetic number, because the mean of its divisors is an integer number (53328595320).
Almost surely, 22060252600412 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 2060252600412, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2559772575360).
2060252600412 is an abundant number, since it is smaller than the sum of its proper divisors (3059292550308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2060252600412 is a wasteful number, since it uses less digits than its factorization.
2060252600412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15331 (or 15329 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 30.
The spelling of 2060252600412 in words is "two trillion, sixty billion, two hundred fifty-two million, six hundred thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •