Base | Representation |
---|---|
bin | 10010110100010111… |
… | …11000110010001001 |
3 | 222002002120120211122 |
4 | 21122023320302021 |
5 | 131142332001301 |
6 | 4350302205025 |
7 | 505235041040 |
oct | 113213706211 |
9 | 28062516748 |
10 | 10103000201 |
11 | 4314975648 |
12 | 1b5b583775 |
13 | c50141738 |
14 | 6bbad5557 |
15 | 3e1e5681b |
hex | 25a2f8c89 |
10103000201 has 4 divisors (see below), whose sum is σ = 11546285952. Its totient is φ = 8659714452.
The previous prime is 10103000191. The next prime is 10103000231. The reversal of 10103000201 is 10200030101.
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, and also an emirpimes, since its reverse is a distinct semiprime: 10200030101 = 6581 ⋅1549921.
It is a cyclic number.
It is not a de Polignac number, because 10103000201 - 26 = 10103000137 is a prime.
It is a super-2 number, since 2×101030002012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10103000231) 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, 721642865 + ... + 721642878.
It is an arithmetic number, because the mean of its divisors is an integer number (2886571488).
Almost surely, 210103000201 is an apocalyptic number.
It is an amenable number.
10103000201 is a deficient number, since it is larger than the sum of its proper divisors (1443285751).
10103000201 is an equidigital number, since it uses as much as digits as its factorization.
10103000201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1443285750.
The product of its (nonzero) digits is 6, while the sum is 8.
Adding to 10103000201 its reverse (10200030101), we get a palindrome (20303030302).
The spelling of 10103000201 in words is "ten billion, one hundred three million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •