Base | Representation |
---|---|
bin | 10010110100010011… |
… | …01110001010100101 |
3 | 222002001111201222202 |
4 | 21122021232022211 |
5 | 131142210314141 |
6 | 4350242104245 |
7 | 505230154514 |
oct | 113211561245 |
9 | 28061451882 |
10 | 10102432421 |
11 | 4314618004 |
12 | 1b5b34b085 |
13 | c4cca3183 |
14 | 6bb9c867b |
15 | 3e1d9349b |
hex | 25a26e2a5 |
10102432421 has 2 divisors, whose sum is σ = 10102432422. Its totient is φ = 10102432420.
The previous prime is 10102432409. The next prime is 10102432433. The reversal of 10102432421 is 12423420101.
It is a balanced prime because it is at equal distance from previous prime (10102432409) and next prime (10102432433).
It can be written as a sum of positive squares in only one way, i.e., 6895475521 + 3206956900 = 83039^2 + 56630^2 .
It is a cyclic number.
It is not a de Polignac number, because 10102432421 - 230 = 9028690597 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10102432393 and 10102432402.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10102432621) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5051216210 + 5051216211.
It is an arithmetic number, because the mean of its divisors is an integer number (5051216211).
Almost surely, 210102432421 is an apocalyptic number.
It is an amenable number.
10102432421 is a deficient number, since it is larger than the sum of its proper divisors (1).
10102432421 is an equidigital number, since it uses as much as digits as its factorization.
10102432421 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 10102432421 its reverse (12423420101), we get a palindrome (22525852522).
The spelling of 10102432421 in words is "ten billion, one hundred two million, four hundred thirty-two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •