Base | Representation |
---|---|
bin | 1001010001101111011111… |
… | …1011110110110101000101 |
3 | 1100010011001020210221011212 |
4 | 2110123313323312311011 |
5 | 2314110420434233013 |
6 | 33410000554141205 |
7 | 2101645501422662 |
oct | 224336773666505 |
9 | 40104036727155 |
10 | 10200412024133 |
11 | 3282a74733031 |
12 | 1188aa9421805 |
13 | 58cb82938c56 |
14 | 2739b9c24a69 |
15 | 12a5096536a8 |
hex | 946f7ef6d45 |
10200412024133 has 2 divisors, whose sum is σ = 10200412024134. Its totient is φ = 10200412024132.
The previous prime is 10200412024123. The next prime is 10200412024147. The reversal of 10200412024133 is 33142021400201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9637404909889 + 563007114244 = 3104417^2 + 750338^2 .
It is a cyclic number.
It is not a de Polignac number, because 10200412024133 - 212 = 10200412020037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10200412024099 and 10200412024108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10200412024123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5100206012066 + 5100206012067.
It is an arithmetic number, because the mean of its divisors is an integer number (5100206012067).
Almost surely, 210200412024133 is an apocalyptic number.
It is an amenable number.
10200412024133 is a deficient number, since it is larger than the sum of its proper divisors (1).
10200412024133 is an equidigital number, since it uses as much as digits as its factorization.
10200412024133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 10200412024133 its reverse (33142021400201), we get a palindrome (43342433424334).
The spelling of 10200412024133 in words is "ten trillion, two hundred billion, four hundred twelve million, twenty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •