Base | Representation |
---|---|
bin | 10011000001100110… |
… | …11010010011011101 |
3 | 222100211111012102111 |
4 | 21200303122103131 |
5 | 131404242240123 |
6 | 4405305554021 |
7 | 511053526555 |
oct | 114063322335 |
9 | 28324435374 |
10 | 10214024413 |
11 | 437160679a |
12 | 1b907a5911 |
13 | c6a145038 |
14 | 6cc756165 |
15 | 3eba8790d |
hex | 260cda4dd |
10214024413 has 2 divisors, whose sum is σ = 10214024414. Its totient is φ = 10214024412.
The previous prime is 10214024369. The next prime is 10214024423. The reversal of 10214024413 is 31442041201.
It is a happy number.
10214024413 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5682445924 + 4531578489 = 75382^2 + 67317^2 .
It is a cyclic number.
It is not a de Polignac number, because 10214024413 - 221 = 10211927261 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10214024423) 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 as a sum of consecutive naturals, namely, 5107012206 + 5107012207.
It is an arithmetic number, because the mean of its divisors is an integer number (5107012207).
Almost surely, 210214024413 is an apocalyptic number.
It is an amenable number.
10214024413 is a deficient number, since it is larger than the sum of its proper divisors (1).
10214024413 is an equidigital number, since it uses as much as digits as its factorization.
10214024413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 10214024413 its reverse (31442041201), we get a palindrome (41656065614).
The spelling of 10214024413 in words is "ten billion, two hundred fourteen million, twenty-four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •