Base | Representation |
---|---|
bin | 1011101101100100011… |
… | …1011110101010100110 |
3 | 201020100202012112222012 |
4 | 2323121013132222212 |
5 | 11244040021041402 |
6 | 232233552234222 |
7 | 20352125143040 |
oct | 2733107365246 |
9 | 636322175865 |
10 | 201211112102 |
11 | 783734776a0 |
12 | 32bb523b972 |
13 | 15c88204460 |
14 | 9a4aca4a90 |
15 | 5379957452 |
hex | 2ed91deaa6 |
201211112102 has 64 divisors (see below), whose sum is σ = 405317219328. Its totient is φ = 72349200000.
The previous prime is 201211112101. The next prime is 201211112117.
201211112102 is nontrivially palindromic in base 10.
It is a super-2 number, since 2×2012111121022 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201211112101) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 19816727 + ... + 19826877.
It is an arithmetic number, because the mean of its divisors is an integer number (6333081552).
Almost surely, 2201211112102 is an apocalyptic number.
201211112102 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
201211112102 is an abundant number, since it is smaller than the sum of its proper divisors (204106107226).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201211112102 is a wasteful number, since it uses less digits than its factorization.
201211112102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20085.
The product of its (nonzero) digits is 16, while the sum is 14.
It can be divided in two parts, 201211 and 112102, that added together give a palindrome (313313).
The spelling of 201211112102 in words is "two hundred one billion, two hundred eleven million, one hundred twelve thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •