Base | Representation |
---|---|
bin | 110000001101010101001010… |
… | …100110001110110001110110 |
3 | 1000210201010122110212102201011 |
4 | 300031111022212032301312 |
5 | 210242233143344244110 |
6 | 2030533412221222434 |
7 | 62442051355144222 |
oct | 6015251246166166 |
9 | 1023633573772634 |
10 | 212022312103030 |
11 | 61614180854420 |
12 | 1b943417401a1a |
13 | 913c8063783a0 |
14 | 3a4dd129c7782 |
15 | 197a2c0bdd48a |
hex | c0d54a98ec76 |
212022312103030 has 128 divisors (see below), whose sum is σ = 459362802640896. Its totient is φ = 69442594099200.
The previous prime is 212022312102989. The next prime is 212022312103057. The reversal of 212022312103030 is 30301213220212.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 212022312102992 and 212022312103010.
It is a congruent number.
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, 915882 + ... + 20612701.
It is an arithmetic number, because the mean of its divisors is an integer number (3588771895632).
Almost surely, 2212022312103030 is an apocalyptic number.
212022312103030 is an abundant number, since it is smaller than the sum of its proper divisors (247340490537866).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212022312103030 is a wasteful number, since it uses less digits than its factorization.
212022312103030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21528782.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 212022312103030 its reverse (30301213220212), we get a palindrome (242323525323242).
The spelling of 212022312103030 in words is "two hundred twelve trillion, twenty-two billion, three hundred twelve million, one hundred three thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •