Base | Representation |
---|---|
bin | 11110101000011111000… |
… | …001011101000101111101 |
3 | 21110020111212022212012022 |
4 | 132220133001131011331 |
5 | 233442122414400140 |
6 | 4251014302245525 |
7 | 305041132411361 |
oct | 36503701350575 |
9 | 7406455285168 |
10 | 2105054450045 |
11 | 7418263a4028 |
12 | 29bb825868a5 |
13 | 123676288451 |
14 | 73c56d072a1 |
15 | 39b55d270b5 |
hex | 1ea1f05d17d |
2105054450045 has 32 divisors (see below), whose sum is σ = 2609585344896. Its totient is φ = 1629341049600.
The previous prime is 2105054450033. The next prime is 2105054450047. The reversal of 2105054450045 is 5400544505012.
It is not a de Polignac number, because 2105054450045 - 222 = 2105050255741 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2105054449987 and 2105054450014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2105054450047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 14046047 + ... + 14195123.
It is an arithmetic number, because the mean of its divisors is an integer number (81549542028).
Almost surely, 22105054450045 is an apocalyptic number.
It is an amenable number.
2105054450045 is a deficient number, since it is larger than the sum of its proper divisors (504530894851).
2105054450045 is a wasteful number, since it uses less digits than its factorization.
2105054450045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149901.
The product of its (nonzero) digits is 80000, while the sum is 35.
Adding to 2105054450045 its reverse (5400544505012), we get a palindrome (7505598955057).
The spelling of 2105054450045 in words is "two trillion, one hundred five billion, fifty-four million, four hundred fifty thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •