Base | Representation |
---|---|
bin | 110100100111101110… |
… | …1001100100011000101 |
3 | 101210200022120201010010 |
4 | 1221033131030203011 |
5 | 3322412031001313 |
6 | 123525033220433 |
7 | 11110204610565 |
oct | 1511735144305 |
9 | 353608521103 |
10 | 113002203333 |
11 | 43a18885998 |
12 | 19a98261719 |
13 | a86b4a3296 |
14 | 567dc00da5 |
15 | 2e159744c3 |
hex | 1a4f74c8c5 |
113002203333 has 8 divisors (see below), whose sum is σ = 150679066048. Its totient is φ = 75330071424.
The previous prime is 113002203289. The next prime is 113002203389. The reversal of 113002203333 is 333302200311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 113002203333 - 26 = 113002203269 is a prime.
It is a super-2 number, since 2×1130022033332 (a number of 23 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 (113002283333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1126585 + ... + 1222782.
It is an arithmetic number, because the mean of its divisors is an integer number (18834883256).
Almost surely, 2113002203333 is an apocalyptic number.
It is an amenable number.
113002203333 is a deficient number, since it is larger than the sum of its proper divisors (37676862715).
113002203333 is a wasteful number, since it uses less digits than its factorization.
113002203333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2365403.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 113002203333 its reverse (333302200311), we get a palindrome (446304403644).
The spelling of 113002203333 in words is "one hundred thirteen billion, two million, two hundred three thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •