Base | Representation |
---|---|
bin | 1001001000000001000001… |
… | …1110110000010101010001 |
3 | 1022112011202022212202211122 |
4 | 2102000100132300111101 |
5 | 2303341214421214301 |
6 | 33201124342252025 |
7 | 2053612011465425 |
oct | 222002036602521 |
9 | 38464668782748 |
10 | 10033320101201 |
11 | 321911a6a1241 |
12 | 1160636727015 |
13 | 57a1a4320137 |
14 | 2698884a6b85 |
15 | 125eca29081b |
hex | 920107b0551 |
10033320101201 has 2 divisors, whose sum is σ = 10033320101202. Its totient is φ = 10033320101200.
The previous prime is 10033320101153. The next prime is 10033320101243. The reversal of 10033320101201 is 10210102333001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5439735240976 + 4593584860225 = 2332324^2 + 2143265^2 .
It is a cyclic number.
It is not a de Polignac number, because 10033320101201 - 226 = 10033252992337 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10033320101201.
It is not a weakly prime, because it can be changed into another prime (10033320101291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5016660050600 + 5016660050601.
It is an arithmetic number, because the mean of its divisors is an integer number (5016660050601).
Almost surely, 210033320101201 is an apocalyptic number.
It is an amenable number.
10033320101201 is a deficient number, since it is larger than the sum of its proper divisors (1).
10033320101201 is an equidigital number, since it uses as much as digits as its factorization.
10033320101201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 10033320101201 its reverse (10210102333001), we get a palindrome (20243422434202).
The spelling of 10033320101201 in words is "ten trillion, thirty-three billion, three hundred twenty million, one hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.389 sec. • engine limits •