Base | Representation |
---|---|
bin | 1001001100011110111010… |
… | …10001000100000010101101 |
3 | 2122121000200011021202020001 |
4 | 10212033131101010002231 |
5 | 10122241303031100023 |
6 | 111000555120224301 |
7 | 4154566335140020 |
oct | 446173521040255 |
9 | 78530604252201 |
10 | 20220123300013 |
11 | 649634051339a |
12 | 232696646b091 |
13 | b389986bb810 |
14 | 4dc932b5d1b7 |
15 | 250e89cce6ad |
hex | 1263dd4440ad |
20220123300013 has 8 divisors (see below), whose sum is σ = 24886305600128. Its totient is φ = 15998339314224.
The previous prime is 20220123299989. The next prime is 20220123300043. The reversal of 20220123300013 is 31000332102202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20220123300013 is a prime.
It is a super-2 number, since 2×202201233000132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20220123300043) 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, 111099578481 + ... + 111099578662.
It is an arithmetic number, because the mean of its divisors is an integer number (3110788200016).
Almost surely, 220220123300013 is an apocalyptic number.
It is an amenable number.
20220123300013 is a deficient number, since it is larger than the sum of its proper divisors (4666182300115).
20220123300013 is a wasteful number, since it uses less digits than its factorization.
20220123300013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 222199157163.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 20220123300013 its reverse (31000332102202), we get a palindrome (51220455402215).
The spelling of 20220123300013 in words is "twenty trillion, two hundred twenty billion, one hundred twenty-three million, three hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •