Base | Representation |
---|---|
bin | 10011101111110001… |
… | …11000111001101000 |
3 | 1000100211021200121210 |
4 | 21313320320321220 |
5 | 133202420231144 |
6 | 4511543233120 |
7 | 523465605240 |
oct | 116770707150 |
9 | 30324250553 |
10 | 10601336424 |
11 | 45501a5a68 |
12 | 207a4487a0 |
13 | ccc463443 |
14 | 727d76b20 |
15 | 420a91ab9 |
hex | 277e38e68 |
10601336424 has 64 divisors (see below), whose sum is σ = 30301286400. Its totient is φ = 3027777984.
The previous prime is 10601336423. The next prime is 10601336429. The reversal of 10601336424 is 42463310601.
It is a super-2 number, since 2×106013364242 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10601336391 and 10601336400.
It is not an unprimeable number, because it can be changed into a prime (10601336423) by changing a digit.
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, 480957 + ... + 502515.
It is an arithmetic number, because the mean of its divisors is an integer number (473457600).
Almost surely, 210601336424 is an apocalyptic number.
10601336424 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
10601336424 is an abundant number, since it is smaller than the sum of its proper divisors (19699949976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10601336424 is a wasteful number, since it uses less digits than its factorization.
10601336424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24502 (or 24498 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 30.
The spelling of 10601336424 in words is "ten billion, six hundred one million, three hundred thirty-six thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.144 sec. • engine limits •