Base | Representation |
---|---|
bin | 10111000010011001110100… |
… | …111011010011001111100101 |
3 | 111021202010020202012102210221 |
4 | 113002121310323103033211 |
5 | 101240012322443340023 |
6 | 555253513100244341 |
7 | 30225101001620101 |
oct | 2702316473231745 |
9 | 437663222172727 |
10 | 101320240215013 |
11 | 2a313744208496 |
12 | b44465b5406b1 |
13 | 446c5c4612971 |
14 | 1b03cd6532901 |
15 | baa88a5b085d |
hex | 5c2674ed33e5 |
101320240215013 has 2 divisors, whose sum is σ = 101320240215014. Its totient is φ = 101320240215012.
The previous prime is 101320240215011. The next prime is 101320240215041. The reversal of 101320240215013 is 310512042023101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 70784912544129 + 30535327670884 = 8413377^2 + 5525878^2 .
It is a cyclic number.
It is not a de Polignac number, because 101320240215013 - 21 = 101320240215011 is a prime.
Together with 101320240215011, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101320240215011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50660120107506 + 50660120107507.
It is an arithmetic number, because the mean of its divisors is an integer number (50660120107507).
Almost surely, 2101320240215013 is an apocalyptic number.
It is an amenable number.
101320240215013 is a deficient number, since it is larger than the sum of its proper divisors (1).
101320240215013 is an equidigital number, since it uses as much as digits as its factorization.
101320240215013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 101320240215013 its reverse (310512042023101), we get a palindrome (411832282238114).
The spelling of 101320240215013 in words is "one hundred one trillion, three hundred twenty billion, two hundred forty million, two hundred fifteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •