Base | Representation |
---|---|
bin | 11110111100000000100… |
… | …101010111000111101001 |
3 | 21112020121220002022011000 |
4 | 132330000211113013221 |
5 | 234313041230334140 |
6 | 4304402433025213 |
7 | 306412502656302 |
oct | 36740045270751 |
9 | 7466556068130 |
10 | 2126018605545 |
11 | 74a70409437a |
12 | 2a40533b5209 |
13 | 12563762cca3 |
14 | 74c852897a9 |
15 | 3a481543a30 |
hex | 1ef009571e9 |
2126018605545 has 32 divisors (see below), whose sum is σ = 3779723088000. Its totient is φ = 1133836252992.
The previous prime is 2126018605511. The next prime is 2126018605553. The reversal of 2126018605545 is 5455068106212.
2126018605545 is a `hidden beast` number, since 2 + 1 + 26 + 0 + 1 + 86 + 0 + 5 + 545 = 666.
It is not a de Polignac number, because 2126018605545 - 26 = 2126018605481 is a prime.
It is a super-2 number, since 2×21260186055452 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2126018605545.
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, 3741931 + ... + 4272479.
It is an arithmetic number, because the mean of its divisors is an integer number (118116346500).
Almost surely, 22126018605545 is an apocalyptic number.
It is an amenable number.
2126018605545 is a deficient number, since it is larger than the sum of its proper divisors (1653704482455).
2126018605545 is a wasteful number, since it uses less digits than its factorization.
2126018605545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 560246 (or 560240 counting only the distinct ones).
The product of its (nonzero) digits is 576000, while the sum is 45.
The spelling of 2126018605545 in words is "two trillion, one hundred twenty-six billion, eighteen million, six hundred five thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •