Base | Representation |
---|---|
bin | 1001010011001111011011… |
… | …11111001001101100001101 |
3 | 2200102020001012000112010120 |
4 | 10221213231333021230031 |
5 | 10140042334001114323 |
6 | 111255401023455153 |
7 | 4210426566020526 |
oct | 451475577115415 |
9 | 80366035015116 |
10 | 20452332051213 |
11 | 6575870285037 |
12 | 23639707574b9 |
13 | b5485387974a |
14 | 509c8076384d |
15 | 25702ac275e3 |
hex | 1299edfc9b0d |
20452332051213 has 4 divisors (see below), whose sum is σ = 27269776068288. Its totient is φ = 13634888034140.
The previous prime is 20452332051127. The next prime is 20452332051341. The reversal of 20452332051213 is 31215023325402.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 20452332051213 - 225 = 20452298496781 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20452332051113) 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, 3408722008533 + ... + 3408722008538.
It is an arithmetic number, because the mean of its divisors is an integer number (6817444017072).
Almost surely, 220452332051213 is an apocalyptic number.
It is an amenable number.
20452332051213 is a deficient number, since it is larger than the sum of its proper divisors (6817444017075).
20452332051213 is an equidigital number, since it uses as much as digits as its factorization.
20452332051213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6817444017074.
The product of its (nonzero) digits is 43200, while the sum is 33.
Adding to 20452332051213 its reverse (31215023325402), we get a palindrome (51667355376615).
The spelling of 20452332051213 in words is "twenty trillion, four hundred fifty-two billion, three hundred thirty-two million, fifty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •