Base | Representation |
---|---|
bin | 1001001100011110110111… |
… | …11000001011110011101001 |
3 | 2122121000121112110000222200 |
4 | 10212033123320023303221 |
5 | 10122241231100013001 |
6 | 111000552525010413 |
7 | 4154565633120615 |
oct | 446173370136351 |
9 | 78530545400880 |
10 | 20220100001001 |
11 | 649632934a50a |
12 | 232695a6b3a09 |
13 | b38993921914 |
14 | 4dc92da16345 |
15 | 250e87c2b086 |
hex | 1263dbe0bce9 |
20220100001001 has 24 divisors (see below), whose sum is σ = 29857348984320. Its totient is φ = 13182210837600.
The previous prime is 20220100000963. The next prime is 20220100001039. The reversal of 20220100001001 is 10010000102202.
It is an interprime number because it is at equal distance from previous prime (20220100000963) and next prime (20220100001039).
It is not a de Polignac number, because 20220100001001 - 221 = 20220097903849 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (20220100009001) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 99582570 + ... + 99785411.
It is an arithmetic number, because the mean of its divisors is an integer number (1244056207680).
Almost surely, 220220100001001 is an apocalyptic number.
It is an amenable number.
20220100001001 is a deficient number, since it is larger than the sum of its proper divisors (9637248983319).
20220100001001 is a wasteful number, since it uses less digits than its factorization.
20220100001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 199368237 (or 199368234 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 20220100001001 its reverse (10010000102202), we get a palindrome (30230100103203).
The spelling of 20220100001001 in words is "twenty trillion, two hundred twenty billion, one hundred million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •