Base | Representation |
---|---|
bin | 100101010110100… |
… | …0110000101111111 |
3 | 10020100101000222111 |
4 | 1022231012011333 |
5 | 10031323213143 |
6 | 324211154451 |
7 | 43026114064 |
oct | 11255060577 |
9 | 3210330874 |
10 | 1253335423 |
11 | 5935254aa |
12 | 2ab8a5a27 |
13 | 16c879ac2 |
14 | bc654c6b |
15 | 7507399d |
hex | 4ab4617f |
1253335423 has 4 divisors (see below), whose sum is σ = 1253409048. Its totient is φ = 1253261800.
The previous prime is 1253335409. The next prime is 1253335451. The reversal of 1253335423 is 3245333521.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 1253335423 - 221 = 1251238271 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 (1253335453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3273 + ... + 50173.
It is an arithmetic number, because the mean of its divisors is an integer number (313352262).
Almost surely, 21253335423 is an apocalyptic number.
1253335423 is a deficient number, since it is larger than the sum of its proper divisors (73625).
1253335423 is an equidigital number, since it uses as much as digits as its factorization.
1253335423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73624.
The product of its digits is 32400, while the sum is 31.
The square root of 1253335423 is about 35402.4776392839. The cubic root of 1253335423 is about 1078.1746208771.
Adding to 1253335423 its reverse (3245333521), we get a palindrome (4498668944).
The spelling of 1253335423 in words is "one billion, two hundred fifty-three million, three hundred thirty-five thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •