Base | Representation |
---|---|
bin | 1001001100100100010011… |
… | …00001100111100100101001 |
3 | 2122121022010120101000201102 |
4 | 10212102021201213210221 |
5 | 10122313212402233001 |
6 | 111002153555331145 |
7 | 4155031056666131 |
oct | 446221141474451 |
9 | 78538116330642 |
10 | 20223013321001 |
11 | 6497593896997 |
12 | 23274322b0ab5 |
13 | b390393773ca |
14 | 4dcb288d7ac1 |
15 | 2510a889be6b |
hex | 126489867929 |
20223013321001 has 8 divisors (see below), whose sum is σ = 20554618033344. Its totient is φ = 19891411186320.
The previous prime is 20223013320973. The next prime is 20223013321019. The reversal of 20223013321001 is 10012331032202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20223013321001 - 226 = 20222946212137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20223013321031) 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, 21191990 + ... + 22125696.
It is an arithmetic number, because the mean of its divisors is an integer number (2569327254168).
Almost surely, 220223013321001 is an apocalyptic number.
It is an amenable number.
20223013321001 is a deficient number, since it is larger than the sum of its proper divisors (331604712343).
20223013321001 is an equidigital number, since it uses as much as digits as its factorization.
20223013321001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1288831.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 20223013321001 its reverse (10012331032202), we get a palindrome (30235344353203).
The spelling of 20223013321001 in words is "twenty trillion, two hundred twenty-three billion, thirteen million, three hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •