Base | Representation |
---|---|
bin | 101111110000000100111011… |
… | …010000010101100110001110 |
3 | 1000112120221201001211002021211 |
4 | 233300010323100111212032 |
5 | 210011314044030323042 |
6 | 2022354104022445034 |
7 | 62143603246252402 |
oct | 5760047320254616 |
9 | 1015527631732254 |
10 | 210012010011022 |
11 | 60a0965871640a |
12 | 1b67989929377a |
13 | 90250806757ab |
14 | 39c08c7c19102 |
15 | 1942d6357e017 |
hex | bf013b41598e |
210012010011022 has 4 divisors (see below), whose sum is σ = 315018015016536. Its totient is φ = 105006005005510.
The previous prime is 210012010011017. The next prime is 210012010011047. The reversal of 210012010011022 is 220110010210012.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×2100120100110222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 210012010010993 and 210012010011011.
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 as a sum of consecutive naturals, namely, 52503002502754 + ... + 52503002502757.
It is an arithmetic number, because the mean of its divisors is an integer number (78754503754134).
Almost surely, 2210012010011022 is an apocalyptic number.
210012010011022 is a deficient number, since it is larger than the sum of its proper divisors (105006005005514).
210012010011022 is a wasteful number, since it uses less digits than its factorization.
210012010011022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105006005005513.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 210012010011022 its reverse (220110010210012), we get a palindrome (430122020221034).
The spelling of 210012010011022 in words is "two hundred ten trillion, twelve billion, ten million, eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •