Base | Representation |
---|---|
bin | 1001010101010011110110… |
… | …11110011000111110000011 |
3 | 2200200000112210111222111211 |
4 | 10222221323132120332003 |
5 | 10142223433334220301 |
6 | 111352155330550551 |
7 | 4215524416503436 |
oct | 452517336307603 |
9 | 80600483458454 |
10 | 20523425304451 |
11 | 65a2a325a3483 |
12 | 23756b1738457 |
13 | b5b473651bb4 |
14 | 50d4a663d81d |
15 | 258cdc2da051 |
hex | 12aa7b798f83 |
20523425304451 has 4 divisors (see below), whose sum is σ = 20523451466952. Its totient is φ = 20523399141952.
The previous prime is 20523425304427. The next prime is 20523425304497. The reversal of 20523425304451 is 15440352432502.
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 20523425304451 - 29 = 20523425303939 is a prime.
It is a super-2 number, since 2×205234253044512 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20523425344451) 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, 11866990 + ... + 13486003.
It is an arithmetic number, because the mean of its divisors is an integer number (5130862866738).
Almost surely, 220523425304451 is an apocalyptic number.
20523425304451 is a deficient number, since it is larger than the sum of its proper divisors (26162501).
20523425304451 is an equidigital number, since it uses as much as digits as its factorization.
20523425304451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26162500.
The product of its (nonzero) digits is 576000, while the sum is 40.
Adding to 20523425304451 its reverse (15440352432502), we get a palindrome (35963777736953).
The spelling of 20523425304451 in words is "twenty trillion, five hundred twenty-three billion, four hundred twenty-five million, three hundred four thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •