Base | Representation |
---|---|
bin | 100101010111100… |
… | …1101100101011001 |
3 | 10020101102020020221 |
4 | 1022233031211121 |
5 | 10031443443033 |
6 | 324231120041 |
7 | 43033615060 |
oct | 11257154531 |
9 | 3211366227 |
10 | 1253890393 |
11 | 593874458 |
12 | 2abb13021 |
13 | 16ca125a2 |
14 | bc75b1d7 |
15 | 7513312d |
hex | 4abcd959 |
1253890393 has 8 divisors (see below), whose sum is σ = 1463507712. Its totient is φ = 1051895616.
The previous prime is 1253890367. The next prime is 1253890409. The reversal of 1253890393 is 3930983521.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1253890393 - 217 = 1253759321 is a prime.
It is a super-2 number, since 2×12538903932 = 3144482235315388898, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1253890343) 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 7 ways as a sum of consecutive naturals, for example, 1905280 + ... + 1905937.
It is an arithmetic number, because the mean of its divisors is an integer number (182938464).
Almost surely, 21253890393 is an apocalyptic number.
It is an amenable number.
1253890393 is a deficient number, since it is larger than the sum of its proper divisors (209617319).
1253890393 is an equidigital number, since it uses as much as digits as its factorization.
1253890393 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3811271.
The product of its (nonzero) digits is 174960, while the sum is 43.
The square root of 1253890393 is about 35410.3147825602. The cubic root of 1253890393 is about 1078.3337339828. Note that the first 3 decimals are identical.
The spelling of 1253890393 in words is "one billion, two hundred fifty-three million, eight hundred ninety thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •