Base | Representation |
---|---|
bin | 10011100011111101… |
… | …10111011111001001 |
3 | 1000002220211002011022 |
4 | 21301332313133021 |
5 | 133002033141301 |
6 | 4454043242225 |
7 | 521153366045 |
oct | 116176673711 |
9 | 30086732138 |
10 | 10502240201 |
11 | 44aa271562 |
12 | 2051219375 |
13 | cb4a7811b |
14 | 718b3d025 |
15 | 417019d1b |
hex | 271fb77c9 |
10502240201 has 4 divisors (see below), whose sum is σ = 10517439504. Its totient is φ = 10487040900.
The previous prime is 10502240183. The next prime is 10502240237. The reversal of 10502240201 is 10204220501.
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 10502240201 - 210 = 10502239177 is a prime.
It is a super-2 number, since 2×105022402012 (a number of 21 digits) contains 22 as substring.
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 10502240201.
It is not an unprimeable number, because it can be changed into a prime (10502240701) 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, 7598615 + ... + 7599996.
It is an arithmetic number, because the mean of its divisors is an integer number (2629359876).
Almost surely, 210502240201 is an apocalyptic number.
It is an amenable number.
10502240201 is a deficient number, since it is larger than the sum of its proper divisors (15199303).
10502240201 is an equidigital number, since it uses as much as digits as its factorization.
10502240201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15199302.
The product of its (nonzero) digits is 160, while the sum is 17.
Adding to 10502240201 its reverse (10204220501), we get a palindrome (20706460702).
The spelling of 10502240201 in words is "ten billion, five hundred two million, two hundred forty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •