Base | Representation |
---|---|
bin | 1100010010000100101… |
… | …1010001100001110100 |
3 | 202011122122112200112200 |
4 | 3010201023101201310 |
5 | 11424122030013022 |
6 | 240534152344500 |
7 | 21150011262216 |
oct | 3044113214164 |
9 | 664578480480 |
10 | 211010001012 |
11 | 8154170a998 |
12 | 34a8a9a5130 |
13 | 16b8a338985 |
14 | a2da4365b6 |
15 | 574ed3bbac |
hex | 31212d1874 |
211010001012 has 36 divisors (see below), whose sum is σ = 534256571940. Its totient is φ = 70221917952.
The previous prime is 211010000989. The next prime is 211010001019. The reversal of 211010001012 is 210100010112.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 6311666916 + 204698334096 = 79446^2 + 452436^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 211010000985 and 211010001003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211010001019) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4758837 + ... + 4802972.
Almost surely, 2211010001012 is an apocalyptic number.
It is an amenable number.
211010001012 is an abundant number, since it is smaller than the sum of its proper divisors (323246570928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211010001012 is a wasteful number, since it uses less digits than its factorization.
211010001012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9562432 (or 9562427 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 211010001012 its reverse (210100010112), we get a palindrome (421110011124).
The spelling of 211010001012 in words is "two hundred eleven billion, ten million, one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •