Base | Representation |
---|---|
bin | 10011010111110100… |
… | …11011001001010101 |
3 | 222211211012200110112 |
4 | 21223322123021111 |
5 | 132300001142440 |
6 | 4440004532405 |
7 | 515506021406 |
oct | 115372331125 |
9 | 28754180415 |
10 | 10400412245 |
11 | 4457841723 |
12 | 20230b1105 |
13 | c999445b2 |
14 | 7093d39ad |
15 | 40d103965 |
hex | 26be9b255 |
10400412245 has 8 divisors (see below), whose sum is σ = 12910856760. Its totient is φ = 8033421760.
The previous prime is 10400412179. The next prime is 10400412257. The reversal of 10400412245 is 54221400401.
It can be written as a sum of positive squares in 4 ways, for example, as 4267486276 + 6132925969 = 65326^2 + 78313^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10400412245 - 222 = 10396217941 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10400412245.
It is a congruent number.
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, 35863346 + ... + 35863635.
It is an arithmetic number, because the mean of its divisors is an integer number (1613857095).
Almost surely, 210400412245 is an apocalyptic number.
It is an amenable number.
10400412245 is a deficient number, since it is larger than the sum of its proper divisors (2510444515).
10400412245 is an equidigital number, since it uses as much as digits as its factorization.
10400412245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71727015.
The product of its (nonzero) digits is 1280, while the sum is 23.
Adding to 10400412245 its reverse (54221400401), we get a palindrome (64621812646).
The spelling of 10400412245 in words is "ten billion, four hundred million, four hundred twelve thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •