Base | Representation |
---|---|
bin | 10011110000011000… |
… | …10100001101110000 |
3 | 1000101011212102101012 |
4 | 21320030110031300 |
5 | 133210221212130 |
6 | 4512244330052 |
7 | 523560105434 |
oct | 117014241560 |
9 | 30334772335 |
10 | 10606429040 |
11 | 4553064139 |
12 | 20800a3928 |
13 | 100052741c |
14 | 7289009c4 |
15 | 42124a995 |
hex | 278314370 |
10606429040 has 40 divisors (see below), whose sum is σ = 24937042320. Its totient is φ = 4194899456.
The previous prime is 10606429027. The next prime is 10606429069. The reversal of 10606429040 is 4092460601.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (40).
It is a super-2 number, since 2×106064290402 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10606428988 and 10606429006.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 737714 + ... + 751953.
It is an arithmetic number, because the mean of its divisors is an integer number (623426058).
Almost surely, 210606429040 is an apocalyptic number.
10606429040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10606429040 is an abundant number, since it is smaller than the sum of its proper divisors (14330613280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10606429040 is a wasteful number, since it uses less digits than its factorization.
10606429040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1489769 (or 1489763 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 32.
Adding to 10606429040 its reverse (4092460601), we get a palindrome (14698889641).
The spelling of 10606429040 in words is "ten billion, six hundred six million, four hundred twenty-nine thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •