Base | Representation |
---|---|
bin | 10110101111001101011110… |
… | …000011001000001111000001 |
3 | 111010002000211122012002022111 |
4 | 112233031132003020033001 |
5 | 101101410131131244413 |
6 | 552403544052535321 |
7 | 30030566321133346 |
oct | 2657153603101701 |
9 | 433060748162274 |
10 | 100001301431233 |
11 | 2995534a6a1784 |
12 | b270b09621541 |
13 | 43a510b9624b7 |
14 | 1a9a1359c67cd |
15 | b863e3b93d3d |
hex | 5af35e0c83c1 |
100001301431233 has 2 divisors, whose sum is σ = 100001301431234. Its totient is φ = 100001301431232.
The previous prime is 100001301431209. The next prime is 100001301431279. The reversal of 100001301431233 is 332134103100001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 51467897336769 + 48533404094464 = 7174113^2 + 6966592^2 .
It is a cyclic number.
It is not a de Polignac number, because 100001301431233 - 225 = 100001267876801 is a prime.
It is not a weakly prime, because it can be changed into another prime (100001301471233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50000650715616 + 50000650715617.
It is an arithmetic number, because the mean of its divisors is an integer number (50000650715617).
Almost surely, 2100001301431233 is an apocalyptic number.
It is an amenable number.
100001301431233 is a deficient number, since it is larger than the sum of its proper divisors (1).
100001301431233 is an equidigital number, since it uses as much as digits as its factorization.
100001301431233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 100001301431233 its reverse (332134103100001), we get a palindrome (432135404531234).
The spelling of 100001301431233 in words is "one hundred trillion, one billion, three hundred one million, four hundred thirty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •