Base | Representation |
---|---|
bin | 10101010000001111… |
… | …01101111011011100 |
3 | 1002110012220222112200 |
4 | 22220013231323130 |
5 | 141332043430022 |
6 | 5124131131500 |
7 | 552522622230 |
oct | 125007557334 |
9 | 32405828480 |
10 | 11410530012 |
11 | 4925a460a2 |
12 | 2265443b90 |
13 | 10cacb4b0b |
14 | 7a36165c0 |
15 | 46bb32bac |
hex | 2a81ededc |
11410530012 has 72 divisors (see below), whose sum is σ = 33035594592. Its totient is φ = 3253046400.
The previous prime is 11410529959. The next prime is 11410530049. The reversal of 11410530012 is 21003501411.
11410530012 is a `hidden beast` number, since 114 + 10 + 530 + 0 + 12 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 67062 + ... + 165282.
Almost surely, 211410530012 is an apocalyptic number.
11410530012 is a gapful number since it is divisible by the number (12) 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 11410530012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16517797296).
11410530012 is an abundant number, since it is smaller than the sum of its proper divisors (21625064580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11410530012 is a wasteful number, since it uses less digits than its factorization.
11410530012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98699 (or 98694 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 18.
The spelling of 11410530012 in words is "eleven billion, four hundred ten million, five hundred thirty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •