Base | Representation |
---|---|
bin | 110001100100010100… |
… | …1001001110100101000 |
3 | 101011202100212221120020 |
4 | 1203020221021310220 |
5 | 3221000013241230 |
6 | 120522251200440 |
7 | 10455550236354 |
oct | 1431051116450 |
9 | 334670787506 |
10 | 106445446440 |
11 | 41163752443 |
12 | 18768446120 |
13 | a064c6c688 |
14 | 521b0a4464 |
15 | 2b80011810 |
hex | 18c8a49d28 |
106445446440 has 64 divisors (see below), whose sum is σ = 323834060160. Its totient is φ = 27985655040.
The previous prime is 106445446403. The next prime is 106445446463. The reversal of 106445446440 is 44644544601.
106445446440 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1064454464402 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106445446392 and 106445446401.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6238279 + ... + 6255318.
It is an arithmetic number, because the mean of its divisors is an integer number (5059907190).
Almost surely, 2106445446440 is an apocalyptic number.
106445446440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106445446440 is an abundant number, since it is smaller than the sum of its proper divisors (217388613720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106445446440 is a wasteful number, since it uses less digits than its factorization.
106445446440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12493682 (or 12493678 counting only the distinct ones).
The product of its (nonzero) digits is 737280, while the sum is 42.
The spelling of 106445446440 in words is "one hundred six billion, four hundred forty-five million, four hundred forty-six thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •