Base | Representation |
---|---|
bin | 10011100101100111… |
… | …111000001100101101 |
3 | 2000021202222211010001 |
4 | 103211213320030231 |
5 | 321033232233303 |
6 | 13355003144301 |
7 | 1343125434535 |
oct | 234547701455 |
9 | 60252884101 |
10 | 21032305453 |
11 | 8a13208425 |
12 | 40ab815091 |
13 | 1ca2516273 |
14 | 10374424c5 |
15 | 8316ce31d |
hex | 4e59f832d |
21032305453 has 4 divisors (see below), whose sum is σ = 21166269340. Its totient is φ = 20898341568.
The previous prime is 21032305439. The next prime is 21032305507. The reversal of 21032305453 is 35450323012.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 13386027204 + 7646278249 = 115698^2 + 87443^2 .
It is a cyclic number.
It is not a de Polignac number, because 21032305453 - 229 = 20495434541 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 (21032305753) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 66981708 + ... + 66982021.
It is an arithmetic number, because the mean of its divisors is an integer number (5291567335).
Almost surely, 221032305453 is an apocalyptic number.
It is an amenable number.
21032305453 is a deficient number, since it is larger than the sum of its proper divisors (133963887).
21032305453 is a wasteful number, since it uses less digits than its factorization.
21032305453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133963886.
The product of its (nonzero) digits is 10800, while the sum is 28.
Adding to 21032305453 its reverse (35450323012), we get a palindrome (56482628465).
The spelling of 21032305453 in words is "twenty-one billion, thirty-two million, three hundred five thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •