Base | Representation |
---|---|
bin | 1100001110100011101… |
… | …00011001000100001011 |
3 | 1111011102201110221012212 |
4 | 12013101310121010023 |
5 | 23340412243000021 |
6 | 521001142455335 |
7 | 42232156035413 |
oct | 6072164310413 |
9 | 1434381427185 |
10 | 420132000011 |
11 | 1521a4619a39 |
12 | 6951143454b |
13 | 30806481b99 |
14 | 16497c09643 |
15 | adde03a85b |
hex | 61d1d1910b |
420132000011 has 4 divisors (see below), whose sum is σ = 420384636672. Its totient is φ = 419879363352.
The previous prime is 420132000007. The next prime is 420132000017. The reversal of 420132000011 is 110000231024.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 420132000011 - 22 = 420132000007 is a prime.
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 420132000011.
It is not an unprimeable number, because it can be changed into a prime (420132000017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 126315836 + ... + 126319161.
It is an arithmetic number, because the mean of its divisors is an integer number (105096159168).
Almost surely, 2420132000011 is an apocalyptic number.
420132000011 is a deficient number, since it is larger than the sum of its proper divisors (252636661).
420132000011 is a wasteful number, since it uses less digits than its factorization.
420132000011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 252636660.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 420132000011 its reverse (110000231024), we get a palindrome (530132231035).
The spelling of 420132000011 in words is "four hundred twenty billion, one hundred thirty-two million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •