Base | Representation |
---|---|
bin | 10100100000001011… |
… | …11100110011011101 |
3 | 1001102010101112121100 |
4 | 22100011330303131 |
5 | 140020344212334 |
6 | 5020131023313 |
7 | 536526320313 |
oct | 122005746335 |
9 | 31363345540 |
10 | 11007413469 |
11 | 4739441728 |
12 | 217243ab39 |
13 | 1065621b10 |
14 | 765c800b3 |
15 | 446555c99 |
hex | 29017ccdd |
11007413469 has 72 divisors (see below), whose sum is σ = 18226047840. Its totient is φ = 6346009152.
The previous prime is 11007413441. The next prime is 11007413471. The reversal of 11007413469 is 96431470011.
11007413469 is a `hidden beast` number, since 110 + 0 + 74 + 13 + 469 = 666.
11007413469 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11007413469 - 216 = 11007347933 is a prime.
It is a super-2 number, since 2×110074134692 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11007413369) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 35854614 + ... + 35854920.
Almost surely, 211007413469 is an apocalyptic number.
11007413469 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
11007413469 is a deficient number, since it is larger than the sum of its proper divisors (7218634371).
11007413469 is a wasteful number, since it uses less digits than its factorization.
11007413469 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 599 (or 469 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 36.
The spelling of 11007413469 in words is "eleven billion, seven million, four hundred thirteen thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •