Base | Representation |
---|---|
bin | 1001010111100010100110… |
… | …1001100011000011001101 |
3 | 1100110200011211020100210212 |
4 | 2111320221221203003031 |
5 | 2322223430231130013 |
6 | 33523434004212205 |
7 | 2112103232163512 |
oct | 225705151430315 |
9 | 40420154210725 |
10 | 10300030333133 |
11 | 3311244669022 |
12 | 11a426b39a065 |
13 | 59939a347918 |
14 | 27874a2c9309 |
15 | 12cdda0e46a8 |
hex | 95e29a630cd |
10300030333133 has 2 divisors, whose sum is σ = 10300030333134. Its totient is φ = 10300030333132.
The previous prime is 10300030333123. The next prime is 10300030333157. The reversal of 10300030333133 is 33133303000301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9535879872484 + 764150460649 = 3088022^2 + 874157^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10300030333133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10300030333099 and 10300030333108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10300030333123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5150015166566 + 5150015166567.
It is an arithmetic number, because the mean of its divisors is an integer number (5150015166567).
Almost surely, 210300030333133 is an apocalyptic number.
It is an amenable number.
10300030333133 is a deficient number, since it is larger than the sum of its proper divisors (1).
10300030333133 is an equidigital number, since it uses as much as digits as its factorization.
10300030333133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2187, while the sum is 23.
Adding to 10300030333133 its reverse (33133303000301), we get a palindrome (43433333333434).
The spelling of 10300030333133 in words is "ten trillion, three hundred billion, thirty million, three hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •