Base | Representation |
---|---|
bin | 100100100001001… |
… | …0100000100010101 |
3 | 10011101200212221110 |
4 | 1021002110010111 |
5 | 10002141441003 |
6 | 321331205233 |
7 | 42236150211 |
oct | 11102240425 |
9 | 3141625843 |
10 | 1225343253 |
11 | 579746582 |
12 | 2a2446819 |
13 | 166b289a4 |
14 | b8a49941 |
15 | 72894a03 |
hex | 49094115 |
1225343253 has 4 divisors (see below), whose sum is σ = 1633791008. Its totient is φ = 816895500.
The previous prime is 1225343243. The next prime is 1225343267. The reversal of 1225343253 is 3523435221.
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 not a de Polignac number, because 1225343253 - 24 = 1225343237 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1225343253.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1225343213) 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, 204223873 + ... + 204223878.
It is an arithmetic number, because the mean of its divisors is an integer number (408447752).
Almost surely, 21225343253 is an apocalyptic number.
It is an amenable number.
1225343253 is a deficient number, since it is larger than the sum of its proper divisors (408447755).
1225343253 is an equidigital number, since it uses as much as digits as its factorization.
1225343253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 408447754.
The product of its digits is 21600, while the sum is 30.
The square root of 1225343253 is about 35004.9032708276. The cubic root of 1225343253 is about 1070.0874103919.
Adding to 1225343253 its reverse (3523435221), we get a palindrome (4748778474).
The spelling of 1225343253 in words is "one billion, two hundred twenty-five million, three hundred forty-three thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •