Base | Representation |
---|---|
bin | 110100110001100000… |
… | …0011100110100011011 |
3 | 101211112011210021120211 |
4 | 1221203000130310123 |
5 | 3324100013241443 |
6 | 124021351431551 |
7 | 11121266623462 |
oct | 1514300346433 |
9 | 354464707524 |
10 | 113330212123 |
11 | 44076a4a837 |
12 | 19b6a0855b7 |
13 | a8c142991b |
14 | 56b15c59d9 |
15 | 2e3466719d |
hex | 1a6301cd1b |
113330212123 has 8 divisors (see below), whose sum is σ = 115922088000. Its totient is φ = 110745861120.
The previous prime is 113330212111. The next prime is 113330212129. The reversal of 113330212123 is 321212033311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113330212123 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113330212094 and 113330212103.
It is not an unprimeable number, because it can be changed into a prime (113330212129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1850748 + ... + 1911001.
It is an arithmetic number, because the mean of its divisors is an integer number (14490261000).
Almost surely, 2113330212123 is an apocalyptic number.
113330212123 is a deficient number, since it is larger than the sum of its proper divisors (2591875877).
113330212123 is an equidigital number, since it uses as much as digits as its factorization.
113330212123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3762437.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 113330212123 its reverse (321212033311), we get a palindrome (434542245434).
The spelling of 113330212123 in words is "one hundred thirteen billion, three hundred thirty million, two hundred twelve thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •