Base | Representation |
---|---|
bin | 110100101101101100… |
… | …0100101011101001101 |
3 | 101211012021010202021001 |
4 | 1221123120211131031 |
5 | 3323314243234404 |
6 | 124000542340301 |
7 | 11115154565644 |
oct | 1513330453515 |
9 | 354167122231 |
10 | 113202321229 |
11 | 44010839488 |
12 | 19b3328a691 |
13 | a8a0a9c13a |
14 | 569c61435b |
15 | 2e283037a4 |
hex | 1a5b62574d |
113202321229 has 4 divisors (see below), whose sum is σ = 113211501984. Its totient is φ = 113193140476.
The previous prime is 113202321191. The next prime is 113202321247. The reversal of 113202321229 is 922123202311.
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, and also an emirpimes, since its reverse is a distinct semiprime: 922123202311 = 53 ⋅17398550987.
It is a cyclic number.
It is not a de Polignac number, because 113202321229 - 27 = 113202321101 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113202321197 and 113202321206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113202321629) 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, 4571857 + ... + 4596550.
It is an arithmetic number, because the mean of its divisors is an integer number (28302875496).
Almost surely, 2113202321229 is an apocalyptic number.
It is an amenable number.
113202321229 is a deficient number, since it is larger than the sum of its proper divisors (9180755).
113202321229 is an equidigital number, since it uses as much as digits as its factorization.
113202321229 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9180754.
The product of its (nonzero) digits is 2592, while the sum is 28.
The spelling of 113202321229 in words is "one hundred thirteen billion, two hundred two million, three hundred twenty-one thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •