Base | Representation |
---|---|
bin | 10011000000001110… |
… | …00100111001101011 |
3 | 222100000121202000222 |
4 | 21200013010321223 |
5 | 131343303334121 |
6 | 4404212520255 |
7 | 510552663305 |
oct | 114007047153 |
9 | 28300552028 |
10 | 10202402411 |
11 | 4365a98a33 |
12 | 1b8892008b |
13 | c67906106 |
14 | 6cadac975 |
15 | 3eaa3e0ab |
hex | 2601c4e6b |
10202402411 has 4 divisors (see below), whose sum is σ = 10292689272. Its totient is φ = 10112115552.
The previous prime is 10202402407. The next prime is 10202402417. The reversal of 10202402411 is 11420420201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11420420201 = 751 ⋅15206951.
It is a cyclic number.
It is not a de Polignac number, because 10202402411 - 22 = 10202402407 is a prime.
It is a super-2 number, since 2×102024024112 (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 10202402411.
It is not an unprimeable number, because it can be changed into a prime (10202402417) 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, 45143261 + ... + 45143486.
It is an arithmetic number, because the mean of its divisors is an integer number (2573172318).
Almost surely, 210202402411 is an apocalyptic number.
10202402411 is a deficient number, since it is larger than the sum of its proper divisors (90286861).
10202402411 is an equidigital number, since it uses as much as digits as its factorization.
10202402411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90286860.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 10202402411 its reverse (11420420201), we get a palindrome (21622822612).
The spelling of 10202402411 in words is "ten billion, two hundred two million, four hundred two thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •