Base | Representation |
---|---|
bin | 11101111111100011001… |
… | …000100011011100000011 |
3 | 21022001001121021201001210 |
4 | 131333203020203130003 |
5 | 232232113100130443 |
6 | 4214504542101203 |
7 | 301623656656545 |
oct | 35774310433403 |
9 | 7261047251053 |
10 | 2061100005123 |
11 | 725120246a95 |
12 | 29355627a803 |
13 | 11c48cb74663 |
14 | 71a87483695 |
15 | 389320b7c33 |
hex | 1dfe3223703 |
2061100005123 has 16 divisors (see below), whose sum is σ = 2876280926976. Its totient is φ = 1310353857120.
The previous prime is 2061100005113. The next prime is 2061100005163. The reversal of 2061100005123 is 3215000011602.
It is not a de Polignac number, because 2061100005123 - 28 = 2061100004867 is a prime.
It is a super-2 number, since 2×20611000051232 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2061100005123.
It is not an unprimeable number, because it can be changed into a prime (2061100005113) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 45099540 + ... + 45145217.
It is an arithmetic number, because the mean of its divisors is an integer number (179767557936).
Almost surely, 22061100005123 is an apocalyptic number.
2061100005123 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
2061100005123 is a deficient number, since it is larger than the sum of its proper divisors (815180921853).
2061100005123 is a wasteful number, since it uses less digits than its factorization.
2061100005123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90245114.
The product of its (nonzero) digits is 360, while the sum is 21.
Adding to 2061100005123 its reverse (3215000011602), we get a palindrome (5276100016725).
The spelling of 2061100005123 in words is "two trillion, sixty-one billion, one hundred million, five thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •