Base | Representation |
---|---|
bin | 110001001011100011… |
… | …0110000100011001000 |
3 | 101002121110000200200202 |
4 | 1202113012300203020 |
5 | 3212244233041230 |
6 | 120304001551332 |
7 | 10426136063321 |
oct | 1422706604310 |
9 | 332543020622 |
10 | 105614346440 |
11 | 408775aa739 |
12 | 18576045548 |
13 | 9c61a1ac25 |
14 | 517c961448 |
15 | 2b32094a45 |
hex | 18971b08c8 |
105614346440 has 16 divisors (see below), whose sum is σ = 237632279580. Its totient is φ = 42245738560.
The previous prime is 105614346379. The next prime is 105614346457. The reversal of 105614346440 is 44643416501.
It can be written as a sum of positive squares in 2 ways, for example, as 95109326404 + 10505020036 = 308398^2 + 102494^2 .
It is a super-2 number, since 2×1056143464402 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105614346394 and 105614346403.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1320179291 + ... + 1320179370.
Almost surely, 2105614346440 is an apocalyptic number.
105614346440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105614346440 is an abundant number, since it is smaller than the sum of its proper divisors (132017933140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105614346440 is a wasteful number, since it uses less digits than its factorization.
105614346440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2640358672 (or 2640358668 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 38.
The spelling of 105614346440 in words is "one hundred five billion, six hundred fourteen million, three hundred forty-six thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •