Base | Representation |
---|---|
bin | 10100100000100001… |
… | …01000010010010100 |
3 | 1001102022122202212010 |
4 | 22100100220102110 |
5 | 140022103304022 |
6 | 5020311024220 |
7 | 536562160251 |
oct | 122020502224 |
9 | 31368582763 |
10 | 11010213012 |
11 | 473aa83aa7 |
12 | 217336b070 |
13 | 1066092156 |
14 | 7663ac428 |
15 | 44690a50c |
hex | 290428494 |
11010213012 has 12 divisors (see below), whose sum is σ = 25690497056. Its totient is φ = 3670071000.
The previous prime is 11010212977. The next prime is 11010213023. The reversal of 11010213012 is 21031201011.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×110102130122 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12), and also a Moran number because the ratio is a prime number: 917517751 = 11010213012 / (1 + 1 + 0 + 1 + 0 + 2 + 1 + 3 + 0 + 1 + 2).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 458758864 + ... + 458758887.
Almost surely, 211010213012 is an apocalyptic number.
11010213012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11010213012 is an abundant number, since it is smaller than the sum of its proper divisors (14680284044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11010213012 is a wasteful number, since it uses less digits than its factorization.
11010213012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 917517758 (or 917517756 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 11010213012 its reverse (21031201011), we get a palindrome (32041414023).
The spelling of 11010213012 in words is "eleven billion, ten million, two hundred thirteen thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •