Base | Representation |
---|---|
bin | 1001010111100010110111… |
… | …1111010011101111000001 |
3 | 1100110200100220020122212202 |
4 | 2111320231333103233001 |
5 | 2322224102401141213 |
6 | 33523445125002545 |
7 | 2112105105115262 |
oct | 225705577235701 |
9 | 40420326218782 |
10 | 10300103146433 |
11 | 3311281780801 |
12 | 11a428b853455 |
13 | 5993ac45cb09 |
14 | 278755c40969 |
15 | 12cde16c8b58 |
hex | 95e2dfd3bc1 |
10300103146433 has 2 divisors, whose sum is σ = 10300103146434. Its totient is φ = 10300103146432.
The previous prime is 10300103146379. The next prime is 10300103146457. The reversal of 10300103146433 is 33464130100301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10113977341504 + 186125804929 = 3180248^2 + 431423^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10300103146433 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10300103146396 and 10300103146405.
It is not a weakly prime, because it can be changed into another prime (10300103346433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5150051573216 + 5150051573217.
It is an arithmetic number, because the mean of its divisors is an integer number (5150051573217).
Almost surely, 210300103146433 is an apocalyptic number.
It is an amenable number.
10300103146433 is a deficient number, since it is larger than the sum of its proper divisors (1).
10300103146433 is an equidigital number, since it uses as much as digits as its factorization.
10300103146433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 10300103146433 its reverse (33464130100301), we get a palindrome (43764233246734).
The spelling of 10300103146433 in words is "ten trillion, three hundred billion, one hundred three million, one hundred forty-six thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •