Base | Representation |
---|---|
bin | 10111000010011001100110… |
… | …101011101001011000000001 |
3 | 111021202002122002111202110122 |
4 | 113002121212223221120001 |
5 | 101240011330303332322 |
6 | 555253433242110025 |
7 | 30225062040363551 |
oct | 2702314653513001 |
9 | 437662562452418 |
10 | 101320001230337 |
11 | 2a31363131879a |
12 | b4445b34ab315 |
13 | 446c586c59006 |
14 | 1b03cb28c3161 |
15 | baa874605442 |
hex | 5c2666ae9601 |
101320001230337 has 2 divisors, whose sum is σ = 101320001230338. Its totient is φ = 101320001230336.
The previous prime is 101320001230303. The next prime is 101320001230339. The reversal of 101320001230337 is 733032100023101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 98535878722576 + 2784122507761 = 9926524^2 + 1668569^2 .
It is a cyclic number.
It is not a de Polignac number, because 101320001230337 - 232 = 101315706263041 is a prime.
Together with 101320001230339, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (101320001230339) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50660000615168 + 50660000615169.
It is an arithmetic number, because the mean of its divisors is an integer number (50660000615169).
Almost surely, 2101320001230337 is an apocalyptic number.
It is an amenable number.
101320001230337 is a deficient number, since it is larger than the sum of its proper divisors (1).
101320001230337 is an equidigital number, since it uses as much as digits as its factorization.
101320001230337 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 26.
Adding to 101320001230337 its reverse (733032100023101), we get a palindrome (834352101253438).
The spelling of 101320001230337 in words is "one hundred one trillion, three hundred twenty billion, one million, two hundred thirty thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •