Base | Representation |
---|---|
bin | 1011110010000100111… |
… | …1001110001101100101 |
3 | 201100111002000101021010 |
4 | 2330201033032031211 |
5 | 11304024300221123 |
6 | 232554014412433 |
7 | 20424116654466 |
oct | 2744117161545 |
9 | 640432011233 |
10 | 202421101413 |
11 | 78934486563 |
12 | 33292501119 |
13 | 1611bab566b |
14 | 9b23874d6d |
15 | 53eacb7993 |
hex | 2f213ce365 |
202421101413 has 4 divisors (see below), whose sum is σ = 269894801888. Its totient is φ = 134947400940.
The previous prime is 202421101409. The next prime is 202421101451. The reversal of 202421101413 is 314101124202.
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 not a de Polignac number, because 202421101413 - 22 = 202421101409 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 202421101413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202421101483) 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, 33736850233 + ... + 33736850238.
It is an arithmetic number, because the mean of its divisors is an integer number (67473700472).
Almost surely, 2202421101413 is an apocalyptic number.
It is an amenable number.
202421101413 is a deficient number, since it is larger than the sum of its proper divisors (67473700475).
202421101413 is an equidigital number, since it uses as much as digits as its factorization.
202421101413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67473700474.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 202421101413 its reverse (314101124202), we get a palindrome (516522225615).
The spelling of 202421101413 in words is "two hundred two billion, four hundred twenty-one million, one hundred one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •