Base | Representation |
---|---|
bin | 10011011010010101… |
… | …00001110010111000 |
3 | 222220021201112100012 |
4 | 21231022201302320 |
5 | 132320340123000 |
6 | 4442035001052 |
7 | 516152350310 |
oct | 115512416270 |
9 | 28807645305 |
10 | 10421411000 |
11 | 4468684370 |
12 | 202a139188 |
13 | ca10b74b0 |
14 | 70c0dc440 |
15 | 40eda0735 |
hex | 26d2a1cb8 |
10421411000 has 512 divisors, whose sum is σ = 33965568000. Its totient is φ = 2886912000.
The previous prime is 10421410999. The next prime is 10421411051. The reversal of 10421411000 is 11412401.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 29028821 + ... + 29029179.
It is an arithmetic number, because the mean of its divisors is an integer number (66339000).
Almost surely, 210421411000 is an apocalyptic number.
10421411000 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 10421411000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16982784000).
10421411000 is an abundant number, since it is smaller than the sum of its proper divisors (23544157000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10421411000 is a wasteful number, since it uses less digits than its factorization.
10421411000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 440 (or 426 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10421411000 its reverse (11412401), we get a palindrome (10432823401).
The spelling of 10421411000 in words is "ten billion, four hundred twenty-one million, four hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •