Base | Representation |
---|---|
bin | 1001000110111101… |
… | …1011100101111001 |
3 | 20022101221110221021 |
4 | 2101233123211321 |
5 | 20001423130410 |
6 | 1042343342441 |
7 | 114410156125 |
oct | 22157334571 |
9 | 6271843837 |
10 | 2445130105 |
11 | 1045237490 |
12 | 582a51a21 |
13 | 2cc75a562 |
14 | 192a4a585 |
15 | e49dceda |
hex | 91bdb979 |
2445130105 has 16 divisors (see below), whose sum is σ = 3224271744. Its totient is φ = 1765290880.
The previous prime is 2445130067. The next prime is 2445130139. The reversal of 2445130105 is 5010315442.
It is a happy number.
It is not a de Polignac number, because 2445130105 - 29 = 2445129593 is a prime.
It is a super-2 number, since 2×24451301052 = 11957322460754622050, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2445130105.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 154717 + ... + 169786.
It is an arithmetic number, because the mean of its divisors is an integer number (201516984).
Almost surely, 22445130105 is an apocalyptic number.
It is an amenable number.
2445130105 is a deficient number, since it is larger than the sum of its proper divisors (779141639).
2445130105 is a wasteful number, since it uses less digits than its factorization.
2445130105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 324656.
The product of its (nonzero) digits is 2400, while the sum is 25.
The square root of 2445130105 is about 49448.2568449081. The cubic root of 2445130105 is about 1347.2059459577.
Adding to 2445130105 its reverse (5010315442), we get a palindrome (7455445547).
The spelling of 2445130105 in words is "two billion, four hundred forty-five million, one hundred thirty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •