Base | Representation |
---|---|
bin | 100101010110100… |
… | …1001110000010101 |
3 | 10020100101210112222 |
4 | 1022231021300111 |
5 | 10031324203141 |
6 | 324211352125 |
7 | 43026205601 |
oct | 11255116025 |
9 | 3210353488 |
10 | 1253350421 |
11 | 5935357a4 |
12 | 2ab8b2645 |
13 | 16c88388b |
14 | bc65a501 |
15 | 7507814b |
hex | 4ab49c15 |
1253350421 has 4 divisors (see below), whose sum is σ = 1267433100. Its totient is φ = 1239267744.
The previous prime is 1253350411. The next prime is 1253350451. The reversal of 1253350421 is 1240533521.
It is a happy number.
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 681471025 + 571879396 = 26105^2 + 23914^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1253350421 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 (1253350411) 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, 7041206 + ... + 7041383.
It is an arithmetic number, because the mean of its divisors is an integer number (316858275).
Almost surely, 21253350421 is an apocalyptic number.
It is an amenable number.
1253350421 is a deficient number, since it is larger than the sum of its proper divisors (14082679).
1253350421 is an equidigital number, since it uses as much as digits as its factorization.
1253350421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14082678.
The product of its (nonzero) digits is 3600, while the sum is 26.
The square root of 1253350421 is about 35402.6894599831. The cubic root of 1253350421 is about 1078.1789215078.
Adding to 1253350421 its reverse (1240533521), we get a palindrome (2493883942).
The spelling of 1253350421 in words is "one billion, two hundred fifty-three million, three hundred fifty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.249 sec. • engine limits •