Base | Representation |
---|---|
bin | 1100000001011111111… |
… | …01001001110010000110 |
3 | 1110111100010211120221222 |
4 | 12000233331021302012 |
5 | 23232033040423142 |
6 | 513441345440342 |
7 | 41563351064024 |
oct | 6005775116206 |
9 | 1414303746858 |
10 | 413121420422 |
11 | 14a2272a9807 |
12 | 680956400b2 |
13 | 2cc59c13639 |
14 | 15dd0ad7714 |
15 | ab2d831bd2 |
hex | 602ff49c86 |
413121420422 has 8 divisors (see below), whose sum is σ = 629840854272. Its totient is φ = 203174469000.
The previous prime is 413121420421. The next prime is 413121420463. The reversal of 413121420422 is 224024121314.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×4131214204222 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 413121420391 and 413121420400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (413121420421) 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 3 ways as a sum of consecutive naturals, for example, 1693120454 + ... + 1693120697.
It is an arithmetic number, because the mean of its divisors is an integer number (78730106784).
Almost surely, 2413121420422 is an apocalyptic number.
413121420422 is a deficient number, since it is larger than the sum of its proper divisors (216719433850).
413121420422 is a wasteful number, since it uses less digits than its factorization.
413121420422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3386241214.
The product of its (nonzero) digits is 3072, while the sum is 26.
Adding to 413121420422 its reverse (224024121314), we get a palindrome (637145541736).
The spelling of 413121420422 in words is "four hundred thirteen billion, one hundred twenty-one million, four hundred twenty thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •