Base | Representation |
---|---|
bin | 110000001000011111… |
… | …1100011100110001001 |
3 | 100212210122012001220212 |
4 | 1200100333203212021 |
5 | 3143142230431213 |
6 | 115252423530505 |
7 | 10316315102435 |
oct | 1402077434611 |
9 | 325718161825 |
10 | 103364311433 |
11 | 3a922506079 |
12 | 180485b9a35 |
13 | 999381b276 |
14 | 5007bbb9c5 |
15 | 2a4e7929a8 |
hex | 1810fe3989 |
103364311433 has 2 divisors, whose sum is σ = 103364311434. Its totient is φ = 103364311432.
The previous prime is 103364311409. The next prime is 103364311459. The reversal of 103364311433 is 334113463301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 80696901184 + 22667410249 = 284072^2 + 150557^2 .
It is a cyclic number.
It is not a de Polignac number, because 103364311433 - 28 = 103364311177 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 103364311433.
It is not a weakly prime, because it can be changed into another prime (103364311403) 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, 51682155716 + 51682155717.
It is an arithmetic number, because the mean of its divisors is an integer number (51682155717).
Almost surely, 2103364311433 is an apocalyptic number.
It is an amenable number.
103364311433 is a deficient number, since it is larger than the sum of its proper divisors (1).
103364311433 is an equidigital number, since it uses as much as digits as its factorization.
103364311433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 32.
Adding to 103364311433 its reverse (334113463301), we get a palindrome (437477774734).
The spelling of 103364311433 in words is "one hundred three billion, three hundred sixty-four million, three hundred eleven thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •