Base | Representation |
---|---|
bin | 110100101101111101… |
… | …1010101010110011110 |
3 | 101211012220021112120010 |
4 | 1221123323111112132 |
5 | 3323324111232202 |
6 | 124001505504050 |
7 | 11115325165005 |
oct | 1513373252636 |
9 | 354186245503 |
10 | 113211430302 |
11 | 440159a0243 |
12 | 19b36342026 |
13 | a8a293b319 |
14 | 569d905c3c |
15 | 2e2900276c |
hex | 1a5bed559e |
113211430302 has 8 divisors (see below), whose sum is σ = 226422860616. Its totient is φ = 37737143432.
The previous prime is 113211430301. The next prime is 113211430309. The reversal of 113211430302 is 203034112311.
It is a sphenic number, since it is the product of 3 distinct primes.
113211430302 is an admirable number.
It is a super-2 number, since 2×1132114303022 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113211430301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9434285853 + ... + 9434285864.
It is an arithmetic number, because the mean of its divisors is an integer number (28302857577).
Almost surely, 2113211430302 is an apocalyptic number.
113211430302 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113211430302 is a wasteful number, since it uses less digits than its factorization.
113211430302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18868571722.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 113211430302 its reverse (203034112311), we get a palindrome (316245542613).
The spelling of 113211430302 in words is "one hundred thirteen billion, two hundred eleven million, four hundred thirty thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •