Base | Representation |
---|---|
bin | 10011011001100000… |
… | …10100101101001000 |
3 | 222212210210112100110 |
4 | 21230300110231020 |
5 | 132312110313030 |
6 | 4441231434320 |
7 | 516040100106 |
oct | 115460245510 |
9 | 28783715313 |
10 | 10414541640 |
11 | 4464812308 |
12 | 20279859a0 |
13 | c9c850899 |
14 | 70b230c76 |
15 | 40e4951b0 |
hex | 26cc14b48 |
10414541640 has 128 divisors (see below), whose sum is σ = 31941504000. Its totient is φ = 2715787008.
The previous prime is 10414541633. The next prime is 10414541659. The reversal of 10414541640 is 4614541401.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 10414541598 and 10414541607.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1112901 + ... + 1122219.
It is an arithmetic number, because the mean of its divisors is an integer number (249543000).
Almost surely, 210414541640 is an apocalyptic number.
10414541640 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 10414541640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15970752000).
10414541640 is an abundant number, since it is smaller than the sum of its proper divisors (21526962360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10414541640 is a wasteful number, since it uses less digits than its factorization.
10414541640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9539 (or 9535 counting only the distinct ones).
The product of its (nonzero) digits is 7680, while the sum is 30.
The spelling of 10414541640 in words is "ten billion, four hundred fourteen million, five hundred forty-one thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •