Base | Representation |
---|---|
bin | 1100001110100011101… |
… | …00011100010000110111 |
3 | 1111011102201111121012001 |
4 | 12013101310130100313 |
5 | 23340412243404421 |
6 | 521001143040131 |
7 | 42232156121536 |
oct | 6072164342067 |
9 | 1434381447161 |
10 | 420132013111 |
11 | 1521a4628868 |
12 | 69511440047 |
13 | 30806487b35 |
14 | 16497c1031d |
15 | adde03e691 |
hex | 61d1d1c437 |
420132013111 has 8 divisors (see below), whose sum is σ = 437434533648. Its totient is φ = 403165464000.
The previous prime is 420132013097. The next prime is 420132013129. The reversal of 420132013111 is 111310231024.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 420132013111 - 27 = 420132012983 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 (420132013181) 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 7 ways as a sum of consecutive naturals, for example, 83990305 + ... + 83995306.
It is an arithmetic number, because the mean of its divisors is an integer number (54679316706).
Almost surely, 2420132013111 is an apocalyptic number.
420132013111 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
420132013111 is a deficient number, since it is larger than the sum of its proper divisors (17302520537).
420132013111 is a wasteful number, since it uses less digits than its factorization.
420132013111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167985713.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 420132013111 its reverse (111310231024), we get a palindrome (531442244135).
The spelling of 420132013111 in words is "four hundred twenty billion, one hundred thirty-two million, thirteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •