Base | Representation |
---|---|
bin | 10010110111111110… |
… | …11110110000011101 |
3 | 222011012121002111122 |
4 | 21123333132300131 |
5 | 131223111133201 |
6 | 4353303500325 |
7 | 506053435253 |
oct | 113377366035 |
9 | 28135532448 |
10 | 10133302301 |
11 | 432aa92001 |
12 | 1b697576a5 |
13 | c564c1085 |
14 | 6c1b425d3 |
15 | 3e493ee1b |
hex | 25bfdec1d |
10133302301 has 4 divisors (see below), whose sum is σ = 10185806652. Its totient is φ = 10080797952.
The previous prime is 10133302259. The next prime is 10133302379. The reversal of 10133302301 is 10320333101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2015112100 + 8118190201 = 44890^2 + 90101^2 .
It is a cyclic number.
It is not a de Polignac number, because 10133302301 - 222 = 10129107997 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10133302301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10133302381) 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, 26251886 + ... + 26252271.
It is an arithmetic number, because the mean of its divisors is an integer number (2546451663).
Almost surely, 210133302301 is an apocalyptic number.
It is an amenable number.
10133302301 is a deficient number, since it is larger than the sum of its proper divisors (52504351).
10133302301 is an equidigital number, since it uses as much as digits as its factorization.
10133302301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52504350.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 10133302301 its reverse (10320333101), we get a palindrome (20453635402).
The spelling of 10133302301 in words is "ten billion, one hundred thirty-three million, three hundred two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •