Base | Representation |
---|---|
bin | 1100000000110000110… |
… | …10011000100100110101 |
3 | 1110110022121120222222021 |
4 | 12000120122120210311 |
5 | 23230230431230010 |
6 | 513334235433141 |
7 | 41550513525331 |
oct | 6003032304465 |
9 | 1413277528867 |
10 | 412726430005 |
11 | 14a04434564a |
12 | 67ba52b57b1 |
13 | 2cbc61372b6 |
14 | 15d944787c1 |
15 | ab08d0c8da |
hex | 6018698935 |
412726430005 has 4 divisors (see below), whose sum is σ = 495271716012. Its totient is φ = 330181144000.
The previous prime is 412726429963. The next prime is 412726430047. The reversal of 412726430005 is 500034627214.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 500034627214 = 2 ⋅250017313607.
It is an interprime number because it is at equal distance from previous prime (412726429963) and next prime (412726430047).
It can be written as a sum of positive squares in 2 ways, for example, as 327871905201 + 84854524804 = 572601^2 + 291298^2 .
It is not a de Polignac number, because 412726430005 - 219 = 412725905717 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 41272642996 + ... + 41272643005.
It is an arithmetic number, because the mean of its divisors is an integer number (123817929003).
Almost surely, 2412726430005 is an apocalyptic number.
It is an amenable number.
412726430005 is a deficient number, since it is larger than the sum of its proper divisors (82545286007).
412726430005 is an equidigital number, since it uses as much as digits as its factorization.
412726430005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82545286006.
The product of its (nonzero) digits is 40320, while the sum is 34.
The spelling of 412726430005 in words is "four hundred twelve billion, seven hundred twenty-six million, four hundred thirty thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •