Base | Representation |
---|---|
bin | 1001101001000000011100… |
… | …11100110111101001000110 |
3 | 2210001201102110102121000021 |
4 | 10310200032130313221012 |
5 | 10234321002430201042 |
6 | 113031123215205354 |
7 | 4315443513256651 |
oct | 464401634675106 |
9 | 83051373377007 |
10 | 21200201022022 |
11 | 6833a55874a30 |
12 | 24648a851685a |
13 | baa22a422c89 |
14 | 534149352898 |
15 | 26b6ec52d867 |
hex | 13480e737a46 |
21200201022022 has 16 divisors (see below), whose sum is σ = 34885043841600. Its totient is φ = 9582620064040.
The previous prime is 21200201021981. The next prime is 21200201022023. The reversal of 21200201022022 is 22022010200212.
It is a super-3 number, since 3×212002010220223 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21200201021987 and 21200201022005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21200201022023) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2691743272 + ... + 2691751147.
It is an arithmetic number, because the mean of its divisors is an integer number (2180315240100).
Almost surely, 221200201022022 is an apocalyptic number.
21200201022022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
21200201022022 is a deficient number, since it is larger than the sum of its proper divisors (13684842819578).
21200201022022 is a wasteful number, since it uses less digits than its factorization.
21200201022022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5383494611.
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 21200201022022 its reverse (22022010200212), we get a palindrome (43222211222234).
The spelling of 21200201022022 in words is "twenty-one trillion, two hundred billion, two hundred one million, twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •