Base | Representation |
---|---|
bin | 110100110100001101… |
… | …0111001111000101001 |
3 | 101211202111200110102001 |
4 | 1221220122321320221 |
5 | 3324241241024001 |
6 | 124034354211001 |
7 | 11123451605413 |
oct | 1515032717051 |
9 | 354674613361 |
10 | 113421033001 |
11 | 44113241911 |
12 | 19b94583a61 |
13 | a9071a83a3 |
14 | 56bd6a79b3 |
15 | 2e3c607001 |
hex | 1a686b9e29 |
113421033001 has 8 divisors (see below), whose sum is σ = 113848285824. Its totient is φ = 112993908720.
The previous prime is 113421032993. The next prime is 113421033053. The reversal of 113421033001 is 100330124311.
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 113421033001 - 23 = 113421032993 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 113421033001.
It is not an unprimeable number, because it can be changed into a prime (113421037001) 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, 1969056 + ... + 2025838.
It is an arithmetic number, because the mean of its divisors is an integer number (14231035728).
Almost surely, 2113421033001 is an apocalyptic number.
It is an amenable number.
113421033001 is a deficient number, since it is larger than the sum of its proper divisors (427252823).
113421033001 is an equidigital number, since it uses as much as digits as its factorization.
113421033001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64271.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 113421033001 its reverse (100330124311), we get a palindrome (213751157312).
The spelling of 113421033001 in words is "one hundred thirteen billion, four hundred twenty-one million, thirty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •