Base | Representation |
---|---|
bin | 11101011101011010010… |
… | …01010001000101100100 |
3 | 10120202201111122121222001 |
4 | 32232231021101011210 |
5 | 113041012340432322 |
6 | 2053001454415044 |
7 | 133062544520434 |
oct | 16565511210544 |
9 | 3522644577861 |
10 | 1012222202212 |
11 | 360310054361 |
12 | 144213201484 |
13 | 745b548c260 |
14 | 36dc57862c4 |
15 | 1b4e4779827 |
hex | ebad251164 |
1012222202212 has 96 divisors (see below), whose sum is σ = 2017969430400. Its totient is φ = 440410079232.
The previous prime is 1012222202209. The next prime is 1012222202261. The reversal of 1012222202212 is 2122022222101.
It is a super-2 number, since 2×10122222022122 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a self number, because there is not a number n which added to its sum of digits gives 1012222202212.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 222610923 + ... + 222615469.
It is an arithmetic number, because the mean of its divisors is an integer number (21020514900).
Almost surely, 21012222202212 is an apocalyptic number.
It is an amenable number.
1012222202212 is a deficient number, since it is larger than the sum of its proper divisors (1005747228188).
1012222202212 is a wasteful number, since it uses less digits than its factorization.
1012222202212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5645 (or 5643 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 1012222202212 its reverse (2122022222101), we get a palindrome (3134244424313).
The spelling of 1012222202212 in words is "one trillion, twelve billion, two hundred twenty-two million, two hundred two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •