Base | Representation |
---|---|
bin | 10010110100011111… |
… | …10101000000111001 |
3 | 222002011112002000221 |
4 | 21122033311000321 |
5 | 131143113031322 |
6 | 4350340300041 |
7 | 505246603066 |
oct | 113217650071 |
9 | 28064462027 |
10 | 10104033337 |
11 | 4315510882 |
12 | 1b5b9a1621 |
13 | c50413a68 |
14 | 6bbcc3c6d |
15 | 3e20ac9c7 |
hex | 25a3f5039 |
10104033337 has 2 divisors, whose sum is σ = 10104033338. Its totient is φ = 10104033336.
The previous prime is 10104033323. The next prime is 10104033343. The reversal of 10104033337 is 73333040101.
It is a happy number.
10104033337 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., 8225764416 + 1878268921 = 90696^2 + 43339^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10104033337 is a prime.
It is not a weakly prime, because it can be changed into another prime (10104033307) 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, 5052016668 + 5052016669.
It is an arithmetic number, because the mean of its divisors is an integer number (5052016669).
Almost surely, 210104033337 is an apocalyptic number.
It is an amenable number.
10104033337 is a deficient number, since it is larger than the sum of its proper divisors (1).
10104033337 is an equidigital number, since it uses as much as digits as its factorization.
10104033337 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 25.
Adding to 10104033337 its reverse (73333040101), we get a palindrome (83437073438).
The spelling of 10104033337 in words is "ten billion, one hundred four million, thirty-three thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •