Base | Representation |
---|---|
bin | 10010110110011011… |
… | …11000111101100001 |
3 | 222010022010122001001 |
4 | 21123031320331201 |
5 | 131211244134213 |
6 | 4352121112001 |
7 | 505535102623 |
oct | 113315707541 |
9 | 28108118031 |
10 | 10120302433 |
11 | 432371300a |
12 | 1b65328601 |
13 | c538bbc47 |
14 | 6c011ac13 |
15 | 3e37231dd |
hex | 25b378f61 |
10120302433 has 2 divisors, whose sum is σ = 10120302434. Its totient is φ = 10120302432.
The previous prime is 10120302431. The next prime is 10120302469. The reversal of 10120302433 is 33420302101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5140459809 + 4979842624 = 71697^2 + 70568^2 .
It is a cyclic number.
It is not a de Polignac number, because 10120302433 - 21 = 10120302431 is a prime.
Together with 10120302431, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 10120302433.
It is not a weakly prime, because it can be changed into another prime (10120302431) 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, 5060151216 + 5060151217.
It is an arithmetic number, because the mean of its divisors is an integer number (5060151217).
Almost surely, 210120302433 is an apocalyptic number.
It is an amenable number.
10120302433 is a deficient number, since it is larger than the sum of its proper divisors (1).
10120302433 is an equidigital number, since it uses as much as digits as its factorization.
10120302433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 10120302433 its reverse (33420302101), we get a palindrome (43540604534).
The spelling of 10120302433 in words is "ten billion, one hundred twenty million, three hundred two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •