Base | Representation |
---|---|
bin | 1001101111010000000001… |
… | …11001101101001011111011 |
3 | 2210211020010210121200212201 |
4 | 10313220000321231023323 |
5 | 10301324322322041042 |
6 | 113313442033451031 |
7 | 4340106530121445 |
oct | 467500071551373 |
9 | 83736123550781 |
10 | 21414722065147 |
11 | 6906a29363814 |
12 | 249a397110a77 |
13 | bc4526c93258 |
14 | 540699bbd495 |
15 | 2720a57091b7 |
hex | 137a00e6d2fb |
21414722065147 has 4 divisors (see below), whose sum is σ = 21993498337216. Its totient is φ = 20835945793080.
The previous prime is 21414722065141. The next prime is 21414722065151. The reversal of 21414722065147 is 74156022741412.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 21414722065147 - 235 = 21380362326779 is a prime.
It is a super-2 number, since 2×214147220651472 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21414722065097 and 21414722065106.
It is not an unprimeable number, because it can be changed into a prime (21414722065141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 289388135979 + ... + 289388136052.
It is an arithmetic number, because the mean of its divisors is an integer number (5498374584304).
Almost surely, 221414722065147 is an apocalyptic number.
21414722065147 is a deficient number, since it is larger than the sum of its proper divisors (578776272069).
21414722065147 is an equidigital number, since it uses as much as digits as its factorization.
21414722065147 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 578776272068.
The product of its (nonzero) digits is 752640, while the sum is 46.
The spelling of 21414722065147 in words is "twenty-one trillion, four hundred fourteen billion, seven hundred twenty-two million, sixty-five thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •