Base | Representation |
---|---|
bin | 1001010111100100000010… |
… | …0101000110001000010101 |
3 | 1100110201011122010121020222 |
4 | 2111321000211012020111 |
5 | 2322230222222321234 |
6 | 33523540110004125 |
7 | 2112115613151065 |
oct | 225710045061025 |
9 | 40421148117228 |
10 | 10300415042069 |
11 | 331142183a599 |
12 | 11a43581a6645 |
13 | 59942bc64249 |
14 | 27878542d3a5 |
15 | 12ce0dc8742e |
hex | 95e40946215 |
10300415042069 has 2 divisors, whose sum is σ = 10300415042070. Its totient is φ = 10300415042068.
The previous prime is 10300415042041. The next prime is 10300415042083. The reversal of 10300415042069 is 96024051400301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5730709332100 + 4569705709969 = 2393890^2 + 2137687^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10300415042069 is a prime.
It is a super-2 number, since 2×103004150420692 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10300415042369) 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, 5150207521034 + 5150207521035.
It is an arithmetic number, because the mean of its divisors is an integer number (5150207521035).
Almost surely, 210300415042069 is an apocalyptic number.
It is an amenable number.
10300415042069 is a deficient number, since it is larger than the sum of its proper divisors (1).
10300415042069 is an equidigital number, since it uses as much as digits as its factorization.
10300415042069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25920, while the sum is 35.
The spelling of 10300415042069 in words is "ten trillion, three hundred billion, four hundred fifteen million, forty-two thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •