Base | Representation |
---|---|
bin | 110001010001100000… |
… | …0011111010101001000 |
3 | 101010010100202122112211 |
4 | 1202203000133111020 |
5 | 3213201342422030 |
6 | 120335453514504 |
7 | 10434112261144 |
oct | 1424300372510 |
9 | 333110678484 |
10 | 105814029640 |
11 | 4096a296680 |
12 | 18610aa2a34 |
13 | 9c941c3c77 |
14 | 519b2a0224 |
15 | 2b4488a12a |
hex | 18a301f548 |
105814029640 has 32 divisors (see below), whose sum is σ = 259725346560. Its totient is φ = 38477828800.
The previous prime is 105814029637. The next prime is 105814029649. The reversal of 105814029640 is 46920418501.
It is a super-2 number, since 2×1058140296402 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a junction number, because it is equal to n+sod(n) for n = 105814029593 and 105814029602.
It is not an unprimeable number, because it can be changed into a prime (105814029649) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 120242776 + ... + 120243655.
It is an arithmetic number, because the mean of its divisors is an integer number (8116417080).
Almost surely, 2105814029640 is an apocalyptic number.
105814029640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105814029640 is an abundant number, since it is smaller than the sum of its proper divisors (153911316920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105814029640 is a wasteful number, since it uses less digits than its factorization.
105814029640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 240486453 (or 240486449 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 40.
The spelling of 105814029640 in words is "one hundred five billion, eight hundred fourteen million, twenty-nine thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •