Base | Representation |
---|---|
bin | 1001001001111011001100… |
… | …00001100110010011010101 |
3 | 2122021121210021010202100102 |
4 | 10210331212001212103111 |
5 | 10114321243143131123 |
6 | 110452341000423445 |
7 | 4145335156333151 |
oct | 444754601462325 |
9 | 78247707122312 |
10 | 20132223411413 |
11 | 64620342a7063 |
12 | 2311914a77b85 |
13 | b305ca9c6009 |
14 | 4d8594b3a061 |
15 | 24da42edd028 |
hex | 124f660664d5 |
20132223411413 has 8 divisors (see below), whose sum is σ = 20432927134080. Its totient is φ = 19831526241120.
The previous prime is 20132223411347. The next prime is 20132223411451. The reversal of 20132223411413 is 31411432223102.
It is a happy number.
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-20132223411413 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20132223411463) 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, 4736708 + ... + 7918386.
It is an arithmetic number, because the mean of its divisors is an integer number (2554115891760).
Almost surely, 220132223411413 is an apocalyptic number.
It is an amenable number.
20132223411413 is a deficient number, since it is larger than the sum of its proper divisors (300703722667).
20132223411413 is an equidigital number, since it uses as much as digits as its factorization.
20132223411413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3276187.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 20132223411413 its reverse (31411432223102), we get a palindrome (51543655634515).
The spelling of 20132223411413 in words is "twenty trillion, one hundred thirty-two billion, two hundred twenty-three million, four hundred eleven thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •