Base | Representation |
---|---|
bin | 1001010111110010101010… |
… | …1010110110101010000101 |
3 | 1100111002022100012002002121 |
4 | 2111330222222312222011 |
5 | 2322311243124420401 |
6 | 33525425523205541 |
7 | 2112315132260602 |
oct | 225745252665205 |
9 | 40432270162077 |
10 | 10304342420101 |
11 | 3313057731864 |
12 | 11a50735168b1 |
13 | 599906809882 |
14 | 278a38c7b6a9 |
15 | 12d08d964ca1 |
hex | 95f2aab6a85 |
10304342420101 has 2 divisors, whose sum is σ = 10304342420102. Its totient is φ = 10304342420100.
The previous prime is 10304342420083. The next prime is 10304342420111. The reversal of 10304342420101 is 10102424340301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7094418696225 + 3209923723876 = 2663535^2 + 1791626^2 .
It is a cyclic number.
It is not a de Polignac number, because 10304342420101 - 211 = 10304342418053 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10304342420111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5152171210050 + 5152171210051.
It is an arithmetic number, because the mean of its divisors is an integer number (5152171210051).
Almost surely, 210304342420101 is an apocalyptic number.
It is an amenable number.
10304342420101 is a deficient number, since it is larger than the sum of its proper divisors (1).
10304342420101 is an equidigital number, since it uses as much as digits as its factorization.
10304342420101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 10304342420101 its reverse (10102424340301), we get a palindrome (20406766760402).
The spelling of 10304342420101 in words is "ten trillion, three hundred four billion, three hundred forty-two million, four hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.009 sec. • engine limits •