Base | Representation |
---|---|
bin | 10011000110110000… |
… | …01111001001110101 |
3 | 222110211210101210001 |
4 | 21203120033021311 |
5 | 132001322420001 |
6 | 4413452031301 |
7 | 512120015635 |
oct | 114330171165 |
9 | 28424711701 |
10 | 10257232501 |
11 | 4393a3865a |
12 | 1ba3162531 |
13 | c76092b59 |
14 | 6d43a26c5 |
15 | 400770001 |
hex | 26360f275 |
10257232501 has 2 divisors, whose sum is σ = 10257232502. Its totient is φ = 10257232500.
The previous prime is 10257232471. The next prime is 10257232507. The reversal of 10257232501 is 10523275201.
10257232501 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7233332401 + 3023900100 = 85049^2 + 54990^2 .
It is a cyclic number.
It is not a de Polignac number, because 10257232501 - 29 = 10257231989 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10257232501.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10257232507) 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 as a sum of consecutive naturals, namely, 5128616250 + 5128616251.
It is an arithmetic number, because the mean of its divisors is an integer number (5128616251).
Almost surely, 210257232501 is an apocalyptic number.
It is an amenable number.
10257232501 is a deficient number, since it is larger than the sum of its proper divisors (1).
10257232501 is an equidigital number, since it uses as much as digits as its factorization.
10257232501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4200, while the sum is 28.
The spelling of 10257232501 in words is "ten billion, two hundred fifty-seven million, two hundred thirty-two thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •