Base | Representation |
---|---|
bin | 110001000111010001… |
… | …0011110001110010100 |
3 | 101002020102120110020110 |
4 | 1202032202132032110 |
5 | 3212000434211333 |
6 | 120241425203020 |
7 | 10422442306440 |
oct | 1421642361624 |
9 | 332212513213 |
10 | 105470616468 |
11 | 40803460238 |
12 | 18535a90470 |
13 | 9c3b005bc9 |
14 | 5167829820 |
15 | 2b24653063 |
hex | 188e89e394 |
105470616468 has 48 divisors (see below), whose sum is σ = 281271070080. Its totient is φ = 30132737664.
The previous prime is 105470616467. The next prime is 105470616469. The reversal of 105470616468 is 864616074501.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (105470616467) and next prime (105470616469).
It is a super-2 number, since 2×1054706164682 (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 (105470616467) 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 15 ways as a sum of consecutive naturals, for example, 2501530 + ... + 2543342.
It is an arithmetic number, because the mean of its divisors is an integer number (5859813960).
Almost surely, 2105470616468 is an apocalyptic number.
It is an amenable number.
105470616468 is an abundant number, since it is smaller than the sum of its proper divisors (175800453612).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105470616468 is a wasteful number, since it uses less digits than its factorization.
105470616468 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71856 (or 71854 counting only the distinct ones).
The product of its (nonzero) digits is 967680, while the sum is 48.
The spelling of 105470616468 in words is "one hundred five billion, four hundred seventy million, six hundred sixteen thousand, four hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •