Base | Representation |
---|---|
bin | 101111110011001000100000… |
… | …001110110011010010010011 |
3 | 1000120100000202022212220121120 |
4 | 233303020200032303102103 |
5 | 210023234134031133021 |
6 | 2023034354055453323 |
7 | 62165016245012442 |
oct | 5763104016632223 |
9 | 1016300668786546 |
10 | 210222010021011 |
11 | 60a8a7211a907a |
12 | 1b6b2525987243 |
13 | 903bb09686831 |
14 | 39cab2a062d59 |
15 | 19485548b42c6 |
hex | bf32203b3493 |
210222010021011 has 16 divisors (see below), whose sum is σ = 288713959269120. Its totient is φ = 135982202680800.
The previous prime is 210222010020947. The next prime is 210222010021057. The reversal of 210222010021011 is 110120010222012.
It is not a de Polignac number, because 210222010021011 - 26 = 210222010020947 is a prime.
It is a super-2 number, since 2×2102220100210112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (210222010021511) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 5396099676 + ... + 5396138633.
It is an arithmetic number, because the mean of its divisors is an integer number (18044622454320).
Almost surely, 2210222010021011 is an apocalyptic number.
210222010021011 is a deficient number, since it is larger than the sum of its proper divisors (78491949248109).
210222010021011 is a wasteful number, since it uses less digits than its factorization.
210222010021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10792238506.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 210222010021011 its reverse (110120010222012), we get a palindrome (320342020243023).
The spelling of 210222010021011 in words is "two hundred ten trillion, two hundred twenty-two billion, ten million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •