Base | Representation |
---|---|
bin | 10100101101011110100… |
… | …110011111100110110101 |
3 | 12001001120202000021210210 |
4 | 110231132212133212311 |
5 | 141304224124333323 |
6 | 3005452512140033 |
7 | 204552515436513 |
oct | 24553646374665 |
9 | 5031522007723 |
10 | 1423221324213 |
11 | 4a9648374927 |
12 | 1ab9b5b37619 |
13 | a42947a83c0 |
14 | 4cc5466b4b3 |
15 | 2704badc293 |
hex | 14b5e99f9b5 |
1423221324213 has 8 divisors (see below), whose sum is σ = 2043599850208. Its totient is φ = 875828507184.
The previous prime is 1423221324211. The next prime is 1423221324311. The reversal of 1423221324213 is 3124231223241.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1423221324213 - 21 = 1423221324211 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 (1423221324211) 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, 18246427195 + ... + 18246427272.
It is an arithmetic number, because the mean of its divisors is an integer number (255449981276).
Almost surely, 21423221324213 is an apocalyptic number.
1423221324213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1423221324213 is a deficient number, since it is larger than the sum of its proper divisors (620378525995).
1423221324213 is a wasteful number, since it uses less digits than its factorization.
1423221324213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36492854483.
The product of its digits is 13824, while the sum is 30.
Adding to 1423221324213 its reverse (3124231223241), we get a palindrome (4547452547454).
The spelling of 1423221324213 in words is "one trillion, four hundred twenty-three billion, two hundred twenty-one million, three hundred twenty-four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •