Base | Representation |
---|---|
bin | 10100100000110110… |
… | …10011111011011100 |
3 | 1001102111221001000020 |
4 | 22100123103323130 |
5 | 140023312410322 |
6 | 5020451032140 |
7 | 536625032145 |
oct | 122033237334 |
9 | 31374831006 |
10 | 11013013212 |
11 | 4741616913 |
12 | 217429b650 |
13 | 1066832886 |
14 | 7668daacc |
15 | 446cb005c |
hex | 2906d3edc |
11013013212 has 12 divisors (see below), whose sum is σ = 25697030856. Its totient is φ = 3671004400.
The previous prime is 11013013189. The next prime is 11013013213. The reversal of 11013013212 is 21231031011.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 11013013191 and 11013013200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11013013213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 458875539 + ... + 458875562.
It is an arithmetic number, because the mean of its divisors is an integer number (2141419238).
Almost surely, 211013013212 is an apocalyptic number.
11013013212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11013013212 is an abundant number, since it is smaller than the sum of its proper divisors (14684017644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11013013212 is a wasteful number, since it uses less digits than its factorization.
11013013212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 917751108 (or 917751106 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 11013013212 its reverse (21231031011), we get a palindrome (32244044223).
The spelling of 11013013212 in words is "eleven billion, thirteen million, thirteen thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •