Base | Representation |
---|---|
bin | 10011010101000110… |
… | …11100101011100001 |
3 | 222210020022022102001 |
4 | 21222203130223201 |
5 | 132223132041001 |
6 | 4433432124001 |
7 | 515111150401 |
oct | 115243345341 |
9 | 28706268361 |
10 | 10377612001 |
11 | 4445989549 |
12 | 2017536601 |
13 | c94cc0723 |
14 | 70637a801 |
15 | 40b0ed001 |
hex | 26a8dcae1 |
10377612001 has 2 divisors, whose sum is σ = 10377612002. Its totient is φ = 10377612000.
The previous prime is 10377611999. The next prime is 10377612017. The reversal of 10377612001 is 10021677301.
10377612001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9928129600 + 449482401 = 99640^2 + 21201^2 .
It is an emirp because it is prime and its reverse (10021677301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10377612001 - 21 = 10377611999 is a prime.
Together with 10377611999, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (10377612031) 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, 5188806000 + 5188806001.
It is an arithmetic number, because the mean of its divisors is an integer number (5188806001).
Almost surely, 210377612001 is an apocalyptic number.
It is an amenable number.
10377612001 is a deficient number, since it is larger than the sum of its proper divisors (1).
10377612001 is an equidigital number, since it uses as much as digits as its factorization.
10377612001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1764, while the sum is 28.
The spelling of 10377612001 in words is "ten billion, three hundred seventy-seven million, six hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •