Base | Representation |
---|---|
bin | 10010001111011010001… |
… | …100011000010011111011 |
3 | 11102211111022011200121102 |
4 | 102033122030120103323 |
5 | 131014130004132111 |
6 | 2355503113002015 |
7 | 156363542400365 |
oct | 22173214302373 |
9 | 4384438150542 |
10 | 1253496161531 |
11 | 4436719a5039 |
12 | 182b293b330b |
13 | 9128677bb63 |
14 | 449532d7d35 |
15 | 2291648013b |
hex | 123da3184fb |
1253496161531 has 2 divisors, whose sum is σ = 1253496161532. Its totient is φ = 1253496161530.
The previous prime is 1253496161503. The next prime is 1253496161609. The reversal of 1253496161531 is 1351616943521.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1253496161531 - 230 = 1252422419707 is a prime.
It is a super-2 number, since 2×12534961615312 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (1253496160531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 626748080765 + 626748080766.
It is an arithmetic number, because the mean of its divisors is an integer number (626748080766).
Almost surely, 21253496161531 is an apocalyptic number.
1253496161531 is a deficient number, since it is larger than the sum of its proper divisors (1).
1253496161531 is an equidigital number, since it uses as much as digits as its factorization.
1253496161531 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 583200, while the sum is 47.
The spelling of 1253496161531 in words is "one trillion, two hundred fifty-three billion, four hundred ninety-six million, one hundred sixty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •