Base | Representation |
---|---|
bin | 110001000110110010… |
… | …0001111010011000101 |
3 | 101002012021212121112220 |
4 | 1202031210033103011 |
5 | 3211432300134110 |
6 | 120240043402553 |
7 | 10422153531534 |
oct | 1421544172305 |
9 | 332167777486 |
10 | 105454302405 |
11 | 407a5228241 |
12 | 18530523459 |
13 | 9c3781340a |
14 | 51655c031b |
15 | 2b22ece370 |
hex | 188d90f4c5 |
105454302405 has 32 divisors (see below), whose sum is σ = 171097211520. Its totient is φ = 55452718080.
The previous prime is 105454302389. The next prime is 105454302409. The reversal of 105454302405 is 504203454501.
It is not a de Polignac number, because 105454302405 - 24 = 105454302389 is a prime.
It is a super-2 number, since 2×1054543024052 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105454302409) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3498850 + ... + 3528860.
It is an arithmetic number, because the mean of its divisors is an integer number (5346787860).
Almost surely, 2105454302405 is an apocalyptic number.
105454302405 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
105454302405 is a deficient number, since it is larger than the sum of its proper divisors (65642909115).
105454302405 is a wasteful number, since it uses less digits than its factorization.
105454302405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33301.
The product of its (nonzero) digits is 48000, while the sum is 33.
Adding to 105454302405 its reverse (504203454501), we get a palindrome (609657756906).
The spelling of 105454302405 in words is "one hundred five billion, four hundred fifty-four million, three hundred two thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •