Base | Representation |
---|---|
bin | 11101101100111011001… |
… | …01111010110110100101 |
3 | 10121120012222011012001211 |
4 | 32312131211322312211 |
5 | 113210042102244303 |
6 | 2100500150151421 |
7 | 133506132114223 |
oct | 16663545726645 |
9 | 3546188135054 |
10 | 1020551212453 |
11 | 3638a460aaa3 |
12 | 145958652571 |
13 | 75311c19796 |
14 | 37575a15b13 |
15 | 1b830ab466d |
hex | ed9d97ada5 |
1020551212453 has 4 divisors (see below), whose sum is σ = 1020553247980. Its totient is φ = 1020549176928.
The previous prime is 1020551212423. The next prime is 1020551212459. The reversal of 1020551212453 is 3542121550201.
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 550040272609 + 470510939844 = 741647^2 + 685938^2 .
It is a cyclic number.
It is not a de Polignac number, because 1020551212453 - 29 = 1020551211941 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 (1020551212459) 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, 323401 + ... + 1464817.
It is an arithmetic number, because the mean of its divisors is an integer number (255138311995).
Almost surely, 21020551212453 is an apocalyptic number.
It is an amenable number.
1020551212453 is a deficient number, since it is larger than the sum of its proper divisors (2035527).
1020551212453 is an equidigital number, since it uses as much as digits as its factorization.
1020551212453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2035526.
The product of its (nonzero) digits is 12000, while the sum is 31.
Adding to 1020551212453 its reverse (3542121550201), we get a palindrome (4562672762654).
The spelling of 1020551212453 in words is "one trillion, twenty billion, five hundred fifty-one million, two hundred twelve thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •