Base | Representation |
---|---|
bin | 10011011100000100… |
… | …11001001111000000 |
3 | 222221022021120111121 |
4 | 21232002121033000 |
5 | 132333112243000 |
6 | 4443320522024 |
7 | 516421004146 |
oct | 115602311700 |
9 | 28838246447 |
10 | 10436056000 |
11 | 4475977377 |
12 | 2033020314 |
13 | ca4144386 |
14 | 710031596 |
15 | 4112e4b1a |
hex | 26e0993c0 |
10436056000 has 112 divisors (see below), whose sum is σ = 26736690240. Its totient is φ = 4030387200.
The previous prime is 10436055961. The next prime is 10436056003. The reversal of 10436056000 is 65063401.
It is a super-2 number, since 2×104360560002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10436056003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 209509 + ... + 254491.
Almost surely, 210436056000 is an apocalyptic number.
10436056000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10436056000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13368345120).
10436056000 is an abundant number, since it is smaller than the sum of its proper divisors (16300634240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10436056000 is an equidigital number, since it uses as much as digits as its factorization.
10436056000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45039 (or 45019 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 25.
The spelling of 10436056000 in words is "ten billion, four hundred thirty-six million, fifty-six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •