Base | Representation |
---|---|
bin | 111101000110101… |
… | …010000010011111 |
3 | 2122110000021121021 |
4 | 331012222002133 |
5 | 4044414431411 |
6 | 245420345011 |
7 | 34255450522 |
oct | 7506520237 |
9 | 2573007537 |
10 | 1025155231 |
11 | 486745331 |
12 | 2473a5167 |
13 | 134506c39 |
14 | 9a218bb9 |
15 | 5eeeea71 |
hex | 3d1aa09f |
1025155231 has 4 divisors (see below), whose sum is σ = 1025421264. Its totient is φ = 1024889200.
The previous prime is 1025155223. The next prime is 1025155247. The reversal of 1025155231 is 1325515201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1325515201 = 5981 ⋅221621.
It is a cyclic number.
It is not a de Polignac number, because 1025155231 - 23 = 1025155223 is a prime.
It is a super-2 number, since 2×10251552312 = 2101886495293326722, 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 = 1025155196 and 1025155205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1025155291) 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, 127150 + ... + 134971.
It is an arithmetic number, because the mean of its divisors is an integer number (256355316).
Almost surely, 21025155231 is an apocalyptic number.
1025155231 is a deficient number, since it is larger than the sum of its proper divisors (266033).
1025155231 is an equidigital number, since it uses as much as digits as its factorization.
1025155231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 266032.
The product of its (nonzero) digits is 1500, while the sum is 25.
The square root of 1025155231 is about 32018.0453963074. The cubic root of 1025155231 is about 1008.3157338883.
The spelling of 1025155231 in words is "one billion, twenty-five million, one hundred fifty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.073 sec. • engine limits •