Base | Representation |
---|---|
bin | 1100001110100010101… |
… | …10101100001101010101 |
3 | 1111011102011211100221211 |
4 | 12013101112230031111 |
5 | 23340403244322401 |
6 | 521000303541421 |
7 | 42232032620104 |
oct | 6072126541525 |
9 | 1434364740854 |
10 | 420124214101 |
11 | 1521a01912a9 |
12 | 6950a8ba871 |
13 | 30804987037 |
14 | 16496b8003b |
15 | addd4ed951 |
hex | 61d15ac355 |
420124214101 has 4 divisors (see below), whose sum is σ = 421974981792. Its totient is φ = 418273446412.
The previous prime is 420124214099. The next prime is 420124214113. The reversal of 420124214101 is 101412421024.
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 420124214101 - 21 = 420124214099 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (420124214131) 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, 925383505 + ... + 925383958.
It is an arithmetic number, because the mean of its divisors is an integer number (105493745448).
Almost surely, 2420124214101 is an apocalyptic number.
It is an amenable number.
420124214101 is a deficient number, since it is larger than the sum of its proper divisors (1850767691).
420124214101 is a wasteful number, since it uses less digits than its factorization.
420124214101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1850767690.
The product of its (nonzero) digits is 512, while the sum is 22.
Adding to 420124214101 its reverse (101412421024), we get a palindrome (521536635125).
The spelling of 420124214101 in words is "four hundred twenty billion, one hundred twenty-four million, two hundred fourteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •