Base | Representation |
---|---|
bin | 1001010010010111001010… |
… | …01101011000000110000101 |
3 | 2200022100001122202000200020 |
4 | 10221023211031120012011 |
5 | 10134044000210423323 |
6 | 111233443055005353 |
7 | 4205310112652151 |
oct | 451134515300605 |
9 | 80270048660606 |
10 | 20422120014213 |
11 | 6563a77387515 |
12 | 2359b3a809859 |
13 | b51a4a5a4588 |
14 | 5086160c2061 |
15 | 25635d6b7ae3 |
hex | 1292e5358185 |
20422120014213 has 8 divisors (see below), whose sum is σ = 27230477436288. Its totient is φ = 13614254634144.
The previous prime is 20422120014203. The next prime is 20422120014229. The reversal of 20422120014213 is 31241002122402.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20422120014213 - 229 = 20421583143301 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20422120014203) 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 7 ways as a sum of consecutive naturals, for example, 122913645 + ... + 123079682.
It is an arithmetic number, because the mean of its divisors is an integer number (3403809679536).
Almost surely, 220422120014213 is an apocalyptic number.
It is an amenable number.
20422120014213 is a deficient number, since it is larger than the sum of its proper divisors (6808357422075).
20422120014213 is a wasteful number, since it uses less digits than its factorization.
20422120014213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 246021003.
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 20422120014213 its reverse (31241002122402), we get a palindrome (51663122136615).
The spelling of 20422120014213 in words is "twenty trillion, four hundred twenty-two billion, one hundred twenty million, fourteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •