Base | Representation |
---|---|
bin | 1100001110100011111… |
… | …01101010100100110000 |
3 | 1111011102220001102221101 |
4 | 12013101331222210300 |
5 | 23340413403243044 |
6 | 521001310534144 |
7 | 42232215512050 |
oct | 6072175524460 |
9 | 1434386042841 |
10 | 420134431024 |
11 | 1521a5a2a440 |
12 | 69512207354 |
13 | 30806b23559 |
14 | 1649827d560 |
15 | adde36acd4 |
hex | 61d1f6a930 |
420134431024 has 40 divisors (see below), whose sum is σ = 1014870187008. Its totient is φ = 163688738880.
The previous prime is 420134431001. The next prime is 420134431069.
420134431024 is nontrivially palindromic in base 10.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a junction number, because it is equal to n+sod(n) for n = 420134430983 and 420134431001.
It is an unprimeable number.
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, 170507872 + ... + 170510335.
Almost surely, 2420134431024 is an apocalyptic number.
420134431024 is a gapful number since it is divisible by the number (44) formed by its first and last digit.
It is an amenable number.
420134431024 is an abundant number, since it is smaller than the sum of its proper divisors (594735755984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
420134431024 is a wasteful number, since it uses less digits than its factorization.
420134431024 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 341018233 (or 341018227 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 28.
It can be divided in two parts, 420134 and 431024, that added together give a palindrome (851158).
The spelling of 420134431024 in words is "four hundred twenty billion, one hundred thirty-four million, four hundred thirty-one thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •