Base | Representation |
---|---|
bin | 100101010110110… |
… | …0011100100001101 |
3 | 10020100121011120112 |
4 | 1022231203210031 |
5 | 10031341044031 |
6 | 324213525405 |
7 | 43030126040 |
oct | 11255434415 |
9 | 3210534515 |
10 | 1253456141 |
11 | 5935a8173 |
12 | 2ab943865 |
13 | 16c8bca32 |
14 | bc686c57 |
15 | 7509962b |
hex | 4ab6390d |
1253456141 has 24 divisors (see below), whose sum is σ = 1508520960. Its totient is φ = 1019502720.
The previous prime is 1253456137. The next prime is 1253456173. The reversal of 1253456141 is 1416543521.
It is not a de Polignac number, because 1253456141 - 22 = 1253456137 is a prime.
It is a super-2 number, since 2×12534561412 = 3142304594821223762, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1253456098 and 1253456107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1253456111) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 433940 + ... + 436818.
It is an arithmetic number, because the mean of its divisors is an integer number (62855040).
Almost surely, 21253456141 is an apocalyptic number.
It is an amenable number.
1253456141 is a deficient number, since it is larger than the sum of its proper divisors (255064819).
1253456141 is an equidigital number, since it uses as much as digits as its factorization.
1253456141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3005 (or 2964 counting only the distinct ones).
The product of its digits is 14400, while the sum is 32.
The square root of 1253456141 is about 35404.1825354011. The cubic root of 1253456141 is about 1078.2092354219.
Adding to 1253456141 its reverse (1416543521), we get a palindrome (2669999662).
The spelling of 1253456141 in words is "one billion, two hundred fifty-three million, four hundred fifty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •