Base | Representation |
---|---|
bin | 1001001100100100010010… |
… | …11001001110110001111101 |
3 | 2122121022010102020022200002 |
4 | 10212102021121032301331 |
5 | 10122313211321403201 |
6 | 111002153440244045 |
7 | 4155031032211001 |
oct | 446221131166175 |
9 | 78538112208602 |
10 | 20223011122301 |
11 | 6497592624a89 |
12 | 2327431610625 |
13 | b39038a876c0 |
14 | 4dcb284c4701 |
15 | 2510a85b576b |
hex | 12648964ec7d |
20223011122301 has 8 divisors (see below), whose sum is σ = 21778776443424. Its totient is φ = 18667267098480.
The previous prime is 20223011122267. The next prime is 20223011122309. The reversal of 20223011122301 is 10322111032202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-20223011122301 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20223011122309) 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, 3324335 + ... + 7176156.
It is an arithmetic number, because the mean of its divisors is an integer number (2722347055428).
Almost surely, 220223011122301 is an apocalyptic number.
It is an amenable number.
20223011122301 is a deficient number, since it is larger than the sum of its proper divisors (1555765321123).
20223011122301 is a wasteful number, since it uses less digits than its factorization.
20223011122301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10648651.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 20223011122301 its reverse (10322111032202), we get a palindrome (30545122154503).
Subtracting from 20223011122301 its reverse (10322111032202), we obtain a palindrome (9900900090099).
The spelling of 20223011122301 in words is "twenty trillion, two hundred twenty-three billion, eleven million, one hundred twenty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •