Base | Representation |
---|---|
bin | 10111000000101010000111… |
… | …111100001100011111011001 |
3 | 111021022122122220202221101202 |
4 | 113000222013330030133121 |
5 | 101231031203313213223 |
6 | 555122435344123545 |
7 | 30213323531005514 |
oct | 2700520774143731 |
9 | 437278586687352 |
10 | 101200300132313 |
11 | 2a2778961580a8 |
12 | b4253679065b5 |
13 | 44611bb976a25 |
14 | 1adc199145d7b |
15 | ba76ba9e3428 |
hex | 5c0a87f0c7d9 |
101200300132313 has 4 divisors (see below), whose sum is σ = 105600313181568. Its totient is φ = 96800287083060.
The previous prime is 101200300132279. The next prime is 101200300132439. The reversal of 101200300132313 is 313231003002101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 101200300132313 - 210 = 101200300131289 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101200300132013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2200006524593 + ... + 2200006524638.
It is an arithmetic number, because the mean of its divisors is an integer number (26400078295392).
Almost surely, 2101200300132313 is an apocalyptic number.
It is an amenable number.
101200300132313 is a deficient number, since it is larger than the sum of its proper divisors (4400013049255).
101200300132313 is an equidigital number, since it uses as much as digits as its factorization.
101200300132313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4400013049254.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 101200300132313 its reverse (313231003002101), we get a palindrome (414431303134414).
The spelling of 101200300132313 in words is "one hundred one trillion, two hundred billion, three hundred million, one hundred thirty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •