Base | Representation |
---|---|
bin | 110000001110110010000111… |
… | …101011011011000011010010 |
3 | 1000211001200021100010221020110 |
4 | 300032302013223123003102 |
5 | 210300402101001401002 |
6 | 2031051320203022150 |
7 | 62452213622620560 |
oct | 6016620753330322 |
9 | 1024050240127213 |
10 | 212122121122002 |
11 | 616525393a7663 |
12 | 1b95a83120a956 |
13 | 914905143a9b0 |
14 | 3a54aa0532a30 |
15 | 197cbb32a0e6c |
hex | c0ec87adb0d2 |
212122121122002 has 128 divisors (see below), whose sum is σ = 552882831556608. Its totient is φ = 52651401753600.
The previous prime is 212122121121983. The next prime is 212122121122081. The reversal of 212122121122002 is 200221121221212.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 212122121122002.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 244900227 + ... + 245764857.
It is an arithmetic number, because the mean of its divisors is an integer number (4319397121536).
Almost surely, 2212122121122002 is an apocalyptic number.
212122121122002 is an abundant number, since it is smaller than the sum of its proper divisors (340760710434606).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212122121122002 is a wasteful number, since it uses less digits than its factorization.
212122121122002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 891104.
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 212122121122002 its reverse (200221121221212), we get a palindrome (412343242343214).
The spelling of 212122121122002 in words is "two hundred twelve trillion, one hundred twenty-two billion, one hundred twenty-one million, one hundred twenty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •