Base | Representation |
---|---|
bin | 10011001100001110… |
… | …01111101101110001 |
3 | 222121001010012212201 |
4 | 21212013033231301 |
5 | 132100044010001 |
6 | 4422211223201 |
7 | 513214663402 |
oct | 114607175561 |
9 | 28531105781 |
10 | 10303110001 |
11 | 4407923048 |
12 | 1bb65a7b01 |
13 | c827369c2 |
14 | 6da5059a9 |
15 | 4047d3501 |
hex | 2661cfb71 |
10303110001 has 4 divisors (see below), whose sum is σ = 10349312512. Its totient is φ = 10256907492.
The previous prime is 10303109983. The next prime is 10303110043. The reversal of 10303110001 is 10001130301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10303110001 - 215 = 10303077233 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 10303110001.
It is not an unprimeable number, because it can be changed into a prime (10303114001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23100921 + ... + 23101366.
It is an arithmetic number, because the mean of its divisors is an integer number (2587328128).
Almost surely, 210303110001 is an apocalyptic number.
It is an amenable number.
10303110001 is a deficient number, since it is larger than the sum of its proper divisors (46202511).
10303110001 is an equidigital number, since it uses as much as digits as its factorization.
10303110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46202510.
The product of its (nonzero) digits is 9, while the sum is 10.
Adding to 10303110001 its reverse (10001130301), we get a palindrome (20304240302).
The spelling of 10303110001 in words is "ten billion, three hundred three million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •