Base | Representation |
---|---|
bin | 1100011011011001010… |
… | …01001101100010101001 |
3 | 1111211020001221110120110 |
4 | 12031230221031202221 |
5 | 23444021233130001 |
6 | 524101121044533 |
7 | 42565031255223 |
oct | 6155451154251 |
9 | 1454201843513 |
10 | 427024505001 |
11 | 155111222a56 |
12 | 6a915786749 |
13 | 3136441b9c3 |
14 | 1694d383413 |
15 | b1941be3d6 |
hex | 636ca4d8a9 |
427024505001 has 8 divisors (see below), whose sum is σ = 569545009024. Its totient is φ = 284593502160.
The previous prime is 427024504987. The next prime is 427024505009. The reversal of 427024505001 is 100505420724.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 427024505001 - 210 = 427024503977 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 427024505001.
It is not an unprimeable number, because it can be changed into a prime (427024505009) 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, 22364161 + ... + 22383246.
It is an arithmetic number, because the mean of its divisors is an integer number (71193126128).
Almost surely, 2427024505001 is an apocalyptic number.
It is an amenable number.
427024505001 is a deficient number, since it is larger than the sum of its proper divisors (142520504023).
427024505001 is a wasteful number, since it uses less digits than its factorization.
427024505001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44750591.
The product of its (nonzero) digits is 11200, while the sum is 30.
Adding to 427024505001 its reverse (100505420724), we get a palindrome (527529925725).
The spelling of 427024505001 in words is "four hundred twenty-seven billion, twenty-four million, five hundred five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •