Base | Representation |
---|---|
bin | 10100100000110000… |
… | …00001011010111010 |
3 | 1001102110022020020100 |
4 | 22100120001122322 |
5 | 140023102312340 |
6 | 5020420340230 |
7 | 536614511262 |
oct | 122030013272 |
9 | 31373266210 |
10 | 11012150970 |
11 | 4741088017 |
12 | 2173b44676 |
13 | 10665c0282 |
14 | 7667547a2 |
15 | 446b8e830 |
hex | 2906016ba |
11012150970 has 24 divisors (see below), whose sum is σ = 28631592756. Its totient is φ = 2936573568.
The previous prime is 11012150939. The next prime is 11012150971. The reversal of 11012150970 is 7905121011.
It can be written as a sum of positive squares in 2 ways, for example, as 9458924049 + 1553226921 = 97257^2 + 39411^2 .
It is not an unprimeable number, because it can be changed into a prime (11012150971) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 61178527 + ... + 61178706.
Almost surely, 211012150970 is an apocalyptic number.
11012150970 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11012150970 is an abundant number, since it is smaller than the sum of its proper divisors (17619441786).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11012150970 is a wasteful number, since it uses less digits than its factorization.
11012150970 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122357246 (or 122357243 counting only the distinct ones).
The product of its (nonzero) digits is 630, while the sum is 27.
Adding to 11012150970 its reverse (7905121011), we get a palindrome (18917271981).
The spelling of 11012150970 in words is "eleven billion, twelve million, one hundred fifty thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •