Base | Representation |
---|---|
bin | 10010111000111101… |
… | …00100101110011101 |
3 | 222011202221012110021 |
4 | 21130132210232131 |
5 | 131232203000323 |
6 | 4354154312141 |
7 | 506212633663 |
oct | 113436445635 |
9 | 28152835407 |
10 | 10141453213 |
11 | 43346499a1 |
12 | 1b70428651 |
13 | c580b60b8 |
14 | 6c2c64c33 |
15 | 3e550005d |
hex | 25c7a4b9d |
10141453213 has 2 divisors, whose sum is σ = 10141453214. Its totient is φ = 10141453212.
The previous prime is 10141453211. The next prime is 10141453219. The reversal of 10141453213 is 31235414101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5876448964 + 4265004249 = 76658^2 + 65307^2 .
It is a cyclic number.
It is not a de Polignac number, because 10141453213 - 21 = 10141453211 is a prime.
Together with 10141453211, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10141453211) 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 as a sum of consecutive naturals, namely, 5070726606 + 5070726607.
It is an arithmetic number, because the mean of its divisors is an integer number (5070726607).
Almost surely, 210141453213 is an apocalyptic number.
It is an amenable number.
10141453213 is a deficient number, since it is larger than the sum of its proper divisors (1).
10141453213 is an equidigital number, since it uses as much as digits as its factorization.
10141453213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 10141453213 its reverse (31235414101), we get a palindrome (41376867314).
The spelling of 10141453213 in words is "ten billion, one hundred forty-one million, four hundred fifty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •