Base | Representation |
---|---|
bin | 10100111000010111… |
… | …11001111001001000 |
3 | 1001221021011021222100 |
4 | 22130023321321020 |
5 | 140424314113000 |
6 | 5052215353400 |
7 | 544541662203 |
oct | 123413717110 |
9 | 31837137870 |
10 | 11210301000 |
11 | 4832a17078 |
12 | 220a382860 |
13 | 109867a502 |
14 | 784bb493a |
15 | 459280a00 |
hex | 29c2f9e48 |
11210301000 has 96 divisors (see below), whose sum is σ = 37890847800. Its totient is φ = 2989411200.
The previous prime is 11210300999. The next prime is 11210301013. The reversal of 11210301000 is 10301211.
11210301000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 1538365284 + 9671935716 = 39222^2 + 98346^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
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 23 ways as a sum of consecutive naturals, for example, 613795 + ... + 631794.
Almost surely, 211210301000 is an apocalyptic number.
11210301000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11210301000 is an abundant number, since it is smaller than the sum of its proper divisors (26680546800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11210301000 is a wasteful number, since it uses less digits than its factorization.
11210301000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1245616 (or 1245599 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 11210301000 its reverse (10301211), we get a palindrome (11220602211).
The spelling of 11210301000 in words is "eleven billion, two hundred ten million, three hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •