Base | Representation |
---|---|
bin | 1001000110110000001010… |
… | …00011001000010111001001 |
3 | 2121220012102210012120012010 |
4 | 10203120011003020113021 |
5 | 10111030024343200323 |
6 | 110330312531210133 |
7 | 4134426053556366 |
oct | 443300503102711 |
9 | 77805383176163 |
10 | 20023222240713 |
11 | 641a889a5020a |
12 | 22b4774746949 |
13 | b23249416483 |
14 | 4d31b447b46d |
15 | 24acb3944c93 |
hex | 1236050c85c9 |
20023222240713 has 16 divisors (see below), whose sum is σ = 27958968014976. Its totient is φ = 12722336140800.
The previous prime is 20023222240699. The next prime is 20023222240729. The reversal of 20023222240713 is 31704222232002.
It is not a de Polignac number, because 20023222240713 - 224 = 20023205463497 is a prime.
It is not an unprimeable number, because it can be changed into a prime (20023222240733) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 523792488 + ... + 523830713.
It is an arithmetic number, because the mean of its divisors is an integer number (1747435500936).
Almost surely, 220023222240713 is an apocalyptic number.
20023222240713 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
20023222240713 is a deficient number, since it is larger than the sum of its proper divisors (7935745774263).
20023222240713 is a wasteful number, since it uses less digits than its factorization.
20023222240713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1047623504.
The product of its (nonzero) digits is 16128, while the sum is 30.
Adding to 20023222240713 its reverse (31704222232002), we get a palindrome (51727444472715).
The spelling of 20023222240713 in words is "twenty trillion, twenty-three billion, two hundred twenty-two million, two hundred forty thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •