Base | Representation |
---|---|
bin | 10010110101010101… |
… | …111101010010010011 |
3 | 1221012022211100100101 |
4 | 102311111331102103 |
5 | 312403402120311 |
6 | 13142350033231 |
7 | 1314061503511 |
oct | 226525752223 |
9 | 57168740311 |
10 | 20222301331 |
11 | 8637a64331 |
12 | 3b044a8817 |
13 | 1ba376c99b |
14 | d9ba314b1 |
15 | 7d552cec1 |
hex | 4b557d493 |
20222301331 has 32 divisors (see below), whose sum is σ = 22372761600. Its totient is φ = 18204769440.
The previous prime is 20222301289. The next prime is 20222301349. The reversal of 20222301331 is 13310322202.
It is not a de Polignac number, because 20222301331 - 229 = 19685430419 is a prime.
It is a super-2 number, since 2×202223013312 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20222301299 and 20222301308.
It is not an unprimeable number, because it can be changed into a prime (20222341331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16534386 + ... + 16535608.
It is an arithmetic number, because the mean of its divisors is an integer number (699148800).
Almost surely, 220222301331 is an apocalyptic number.
20222301331 is a deficient number, since it is larger than the sum of its proper divisors (2150460269).
20222301331 is a wasteful number, since it uses less digits than its factorization.
20222301331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1759.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 20222301331 its reverse (13310322202), we get a palindrome (33532623533).
The spelling of 20222301331 in words is "twenty billion, two hundred twenty-two million, three hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •