Base | Representation |
---|---|
bin | 110001001011111010… |
… | …0100110110100111000 |
3 | 101002122021122022101111 |
4 | 1202113310212310320 |
5 | 3212310322141430 |
6 | 120305111330104 |
7 | 10426343201464 |
oct | 1422764466470 |
9 | 332567568344 |
10 | 105626365240 |
11 | 40883369630 |
12 | 1857a080934 |
13 | 9c64368646 |
14 | 51803ad4a4 |
15 | 2b3316ac2a |
hex | 1897d26d38 |
105626365240 has 64 divisors (see below), whose sum is σ = 259359291360. Its totient is φ = 38395576320.
The previous prime is 105626365223. The next prime is 105626365267. The reversal of 105626365240 is 42563626501.
It is a happy number.
It is a super-2 number, since 2×1056263652402 (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 = 105626365193 and 105626365202.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1204152 + ... + 1288888.
Almost surely, 2105626365240 is an apocalyptic number.
105626365240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105626365240 is an abundant number, since it is smaller than the sum of its proper divisors (153732926120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105626365240 is a wasteful number, since it uses less digits than its factorization.
105626365240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87592 (or 87588 counting only the distinct ones).
The product of its (nonzero) digits is 259200, while the sum is 40.
The spelling of 105626365240 in words is "one hundred five billion, six hundred twenty-six million, three hundred sixty-five thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •