Base | Representation |
---|---|
bin | 1001001100001110100001… |
… | …01011111010111000110011 |
3 | 2122120011221210122201121210 |
4 | 10212013100223322320303 |
5 | 10122120242002131003 |
6 | 110552541524251203 |
7 | 4154135256655500 |
oct | 446072053727063 |
9 | 78504853581553 |
10 | 20211322302003 |
11 | 6492634593318 |
12 | 232510ab40b03 |
13 | b37bc52364a1 |
14 | 4dc339d4a4a7 |
15 | 250b22311503 |
hex | 1261d0afae33 |
20211322302003 has 24 divisors (see below), whose sum is σ = 31351408347792. Its totient is φ = 11548135194624.
The previous prime is 20211322301993. The next prime is 20211322302007. The reversal of 20211322302003 is 30020322311202.
It is a happy number.
It is not a de Polignac number, because 20211322302003 - 26 = 20211322301939 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (20211322302007) 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 23 ways as a sum of consecutive naturals, for example, 5663950 + ... + 8514867.
It is an arithmetic number, because the mean of its divisors is an integer number (1306308681158).
Almost surely, 220211322302003 is an apocalyptic number.
20211322302003 is a deficient number, since it is larger than the sum of its proper divisors (11140086045789).
20211322302003 is a wasteful number, since it uses less digits than its factorization.
20211322302003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14188531 (or 14188524 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 20211322302003 its reverse (30020322311202), we get a palindrome (50231644613205).
The spelling of 20211322302003 in words is "twenty trillion, two hundred eleven billion, three hundred twenty-two million, three hundred two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.188 sec. • engine limits •