Base | Representation |
---|---|
bin | 101111110000001110001111… |
… | …111101100111010111010100 |
3 | 1000112121220112202110011000120 |
4 | 233300032033331213113110 |
5 | 210012000044400213022 |
6 | 2022402441243111540 |
7 | 62144406320153601 |
oct | 5760161775472724 |
9 | 1015556482404016 |
10 | 210022021101012 |
11 | 60a129257154aa |
12 | 1b67b811b125b0 |
13 | 9025cb7746993 |
14 | 39c11976276a8 |
15 | 194324c3ccd5c |
hex | bf038ff675d4 |
210022021101012 has 48 divisors (see below), whose sum is σ = 490557587184000. Its totient is φ = 69935037356160.
The previous prime is 210022021100989. The next prime is 210022021101089. The reversal of 210022021101012 is 210101120220012.
It is a junction number, because it is equal to n+sod(n) for n = 210022021100982 and 210022021101000.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 141209289 + ... + 142688847.
It is an arithmetic number, because the mean of its divisors is an integer number (10219949733000).
Almost surely, 2210022021101012 is an apocalyptic number.
It is an amenable number.
210022021101012 is an abundant number, since it is smaller than the sum of its proper divisors (280535566082988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210022021101012 is a wasteful number, since it uses less digits than its factorization.
210022021101012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1491776 (or 1491774 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 210022021101012 its reverse (210101120220012), we get a palindrome (420123141321024).
The spelling of 210022021101012 in words is "two hundred ten trillion, twenty-two billion, twenty-one million, one hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •