Base | Representation |
---|---|
bin | 101101101101010000010100… |
… | …111010000111001101110100 |
3 | 222100202111220211010100222211 |
4 | 231231100110322013031310 |
5 | 202322021024011201322 |
6 | 1551312122034303204 |
7 | 60225234362660434 |
oct | 5555202472071564 |
9 | 870674824110884 |
10 | 201022000100212 |
11 | 59062a51473145 |
12 | 1a6674b1127b04 |
13 | 88223a74131a5 |
14 | 378d733c362c4 |
15 | 183909be53b77 |
hex | b6d414e87374 |
201022000100212 has 6 divisors (see below), whose sum is σ = 351788500175378. Its totient is φ = 100511000050104.
The previous prime is 201022000100209. The next prime is 201022000100279. The reversal of 201022000100212 is 212001000220102.
It is a happy number.
201022000100212 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 102768784600036 + 98253215500176 = 10137494^2 + 9912276^2 .
It is a junction number, because it is equal to n+sod(n) for n = 201022000100192 and 201022000100201.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25127750012523 + ... + 25127750012530.
Almost surely, 2201022000100212 is an apocalyptic number.
It is an amenable number.
201022000100212 is a deficient number, since it is larger than the sum of its proper divisors (150766500075166).
201022000100212 is a wasteful number, since it uses less digits than its factorization.
201022000100212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50255500025057 (or 50255500025055 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 201022000100212 its reverse (212001000220102), we get a palindrome (413023000320314).
The spelling of 201022000100212 in words is "two hundred one trillion, twenty-two billion, one hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •