Base | Representation |
---|---|
bin | 10011000110000010… |
… | …00010111101100011 |
3 | 222110102100112121122 |
4 | 21203001002331203 |
5 | 131443243401001 |
6 | 4413113442455 |
7 | 512014236113 |
oct | 114301027543 |
9 | 28412315548 |
10 | 10251153251 |
11 | 4390566189 |
12 | 1ba111042b |
13 | c74a44a71 |
14 | 6d365d043 |
15 | 3eee6db1b |
hex | 263042f63 |
10251153251 has 2 divisors, whose sum is σ = 10251153252. Its totient is φ = 10251153250.
The previous prime is 10251153149. The next prime is 10251153271. The reversal of 10251153251 is 15235115201.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10251153251 is a prime.
It is a super-2 number, since 2×102511532512 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10251153251.
It is not a weakly prime, because it can be changed into another prime (10251153271) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5125576625 + 5125576626.
It is an arithmetic number, because the mean of its divisors is an integer number (5125576626).
Almost surely, 210251153251 is an apocalyptic number.
10251153251 is a deficient number, since it is larger than the sum of its proper divisors (1).
10251153251 is an equidigital number, since it uses as much as digits as its factorization.
10251153251 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1500, while the sum is 26.
Adding to 10251153251 its reverse (15235115201), we get a palindrome (25486268452).
The spelling of 10251153251 in words is "ten billion, two hundred fifty-one million, one hundred fifty-three thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •