Base | Representation |
---|---|
bin | 110000000001101010001010… |
… | …111001111010101111010110 |
3 | 1000200212110100010212200012020 |
4 | 300001222022321322233112 |
5 | 210141113013410340202 |
6 | 2025121122435434010 |
7 | 62330105153611425 |
oct | 6001521271725726 |
9 | 1020773303780166 |
10 | 211220232121302 |
11 | 61334aa7594668 |
12 | 1b833a90455906 |
13 | 90b1ca04cc6c1 |
14 | 3a231843072bc |
15 | 19644c9eda5bc |
hex | c01a8ae7abd6 |
211220232121302 has 16 divisors (see below), whose sum is σ = 425766767112192. Its totient is φ = 69852360228840.
The previous prime is 211220232121291. The next prime is 211220232121343. The reversal of 211220232121302 is 203121232022112.
211220232121302 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2112202321213022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 138595952074 + ... + 138595953597.
It is an arithmetic number, because the mean of its divisors is an integer number (26610422944512).
Almost surely, 2211220232121302 is an apocalyptic number.
211220232121302 is an abundant number, since it is smaller than the sum of its proper divisors (214546534990890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211220232121302 is a wasteful number, since it uses less digits than its factorization.
211220232121302 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 277191905803.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 211220232121302 its reverse (203121232022112), we get a palindrome (414341464143414).
The spelling of 211220232121302 in words is "two hundred eleven trillion, two hundred twenty billion, two hundred thirty-two million, one hundred twenty-one thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •