Base | Representation |
---|---|
bin | 10111101011111100111… |
… | …00100100000111000101 |
3 | 2212210202000102201221211 |
4 | 23311332130210013011 |
5 | 101313301240023401 |
6 | 1421515315411421 |
7 | 112541314602106 |
oct | 13657634440705 |
9 | 2783660381854 |
10 | 813870236101 |
11 | 29418459243a |
12 | 1118975b3b71 |
13 | 5b994723380 |
14 | 2b56a5003ad |
15 | 16285d41951 |
hex | bd7e7241c5 |
813870236101 has 8 divisors (see below), whose sum is σ = 876885045624. Its totient is φ = 750913913280.
The previous prime is 813870236093. The next prime is 813870236147. The reversal of 813870236101 is 101632078318.
It can be written as a sum of positive squares in 4 ways, for example, as 294355077025 + 519515159076 = 542545^2 + 720774^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 813870236101 - 23 = 813870236093 is a prime.
It is a super-2 number, since 2×8138702361012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (813870236171) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14592766 + ... + 14648431.
It is an arithmetic number, because the mean of its divisors is an integer number (109610630703).
Almost surely, 2813870236101 is an apocalyptic number.
It is an amenable number.
813870236101 is a deficient number, since it is larger than the sum of its proper divisors (63014809523).
813870236101 is a wasteful number, since it uses less digits than its factorization.
813870236101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29243351.
The product of its (nonzero) digits is 48384, while the sum is 40.
The spelling of 813870236101 in words is "eight hundred thirteen billion, eight hundred seventy million, two hundred thirty-six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •