Base | Representation |
---|---|
bin | 10100100111110100… |
… | …10011100110010010 |
3 | 1001120120220221121100 |
4 | 22103322103212102 |
5 | 140133244014340 |
6 | 5030340005230 |
7 | 541234641051 |
oct | 122372234622 |
9 | 31516827540 |
10 | 11071469970 |
11 | 4771613290 |
12 | 218b990816 |
13 | 107598c282 |
14 | 770596398 |
15 | 44beaa830 |
hex | 293e93992 |
11071469970 has 96 divisors (see below), whose sum is σ = 31428057024. Its totient is φ = 2681827200.
The previous prime is 11071469953. The next prime is 11071469999. The reversal of 11071469970 is 7996417011.
11071469970 is a `hidden beast` number, since 110 + 7 + 1 + 469 + 9 + 70 = 666.
11071469970 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×110714699702 (a number of 21 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (45) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 1464400 + ... + 1471940.
It is an arithmetic number, because the mean of its divisors is an integer number (327375594).
Almost surely, 211071469970 is an apocalyptic number.
11071469970 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 11071469970, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15714028512).
11071469970 is an abundant number, since it is smaller than the sum of its proper divisors (20356587054).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11071469970 is a wasteful number, since it uses less digits than its factorization.
11071469970 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9048 (or 9045 counting only the distinct ones).
The product of its (nonzero) digits is 95256, while the sum is 45.
The spelling of 11071469970 in words is "eleven billion, seventy-one million, four hundred sixty-nine thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •