Base | Representation |
---|---|
bin | 1100001010011110100… |
… | …10010010000010011011 |
3 | 1110221210002122102202101 |
4 | 12011033102102002123 |
5 | 23321421124122001 |
6 | 515555551544231 |
7 | 42123664361650 |
oct | 6051722220233 |
9 | 1427702572671 |
10 | 417942020251 |
11 | 151280413808 |
12 | 68bbbb2b077 |
13 | 3054784b382 |
14 | 1632b019c27 |
15 | ad11b4ca01 |
hex | 614f49209b |
417942020251 has 16 divisors (see below), whose sum is σ = 494048475648. Its totient is φ = 346105339200.
The previous prime is 417942020233. The next prime is 417942020339. The reversal of 417942020251 is 152020249714.
It is a cyclic number.
It is not a de Polignac number, because 417942020251 - 27 = 417942020123 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 417942020251.
It is not an unprimeable number, because it can be changed into a prime (417942020051) 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 15 ways as a sum of consecutive naturals, for example, 7039585 + ... + 7098706.
It is an arithmetic number, because the mean of its divisors is an integer number (30878029728).
Almost surely, 2417942020251 is an apocalyptic number.
417942020251 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
417942020251 is a deficient number, since it is larger than the sum of its proper divisors (76106455397).
417942020251 is a wasteful number, since it uses less digits than its factorization.
417942020251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14138442.
The product of its (nonzero) digits is 40320, while the sum is 37.
Adding to 417942020251 its reverse (152020249714), we get a palindrome (569962269965).
The spelling of 417942020251 in words is "four hundred seventeen billion, nine hundred forty-two million, twenty thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •