Base | Representation |
---|---|
bin | 10110101111101011… |
… | …01100110011111010 |
3 | 1011112000100211020020 |
4 | 23113311230303322 |
5 | 200002021110320 |
6 | 5335410311310 |
7 | 611413515102 |
oct | 132765546372 |
9 | 34460324206 |
10 | 12211113210 |
11 | 51a69450aa |
12 | 2449588536 |
13 | 11c7b1029a |
14 | 83ba94202 |
15 | 4b7072940 |
hex | 2d7d6ccfa |
12211113210 has 32 divisors (see below), whose sum is σ = 29719446912. Its totient is φ = 3210432960.
The previous prime is 12211113203. The next prime is 12211113221. The reversal of 12211113210 is 1231111221.
It is a super-4 number, since 4×122111132104 (a number of 41 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 12211113210.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2864329 + ... + 2868588.
It is an arithmetic number, because the mean of its divisors is an integer number (928732716).
Almost surely, 212211113210 is an apocalyptic number.
12211113210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12211113210 is an abundant number, since it is smaller than the sum of its proper divisors (17508333702).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12211113210 is a wasteful number, since it uses less digits than its factorization.
12211113210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5732998.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 12211113210 its reverse (1231111221), we get a palindrome (13442224431).
The spelling of 12211113210 in words is "twelve billion, two hundred eleven million, one hundred thirteen thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •