Base | Representation |
---|---|
bin | 11001101100011001100111… |
… | …001101110011100010101111 |
3 | 112211002220202001121202111122 |
4 | 121230121213031303202233 |
5 | 104302412223213324444 |
6 | 1040200314423211155 |
7 | 32542101602066225 |
oct | 3154314715634257 |
9 | 484086661552448 |
10 | 113002321229999 |
11 | 33008019408373 |
12 | 108107348a6abb |
13 | 4b090c499a726 |
14 | 1dc94ad230b15 |
15 | d0e6b2b1d4ee |
hex | 66c6673738af |
113002321229999 has 4 divisors (see below), whose sum is σ = 113365672745520. Its totient is φ = 112638969714480.
The previous prime is 113002321229857. The next prime is 113002321230013. The reversal of 113002321229999 is 999922123200311.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113002321229999 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 113002321229999.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113002321226999) 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, 181675757294 + ... + 181675757915.
It is an arithmetic number, because the mean of its divisors is an integer number (28341418186380).
Almost surely, 2113002321229999 is an apocalyptic number.
113002321229999 is a deficient number, since it is larger than the sum of its proper divisors (363351515521).
113002321229999 is an equidigital number, since it uses as much as digits as its factorization.
113002321229999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 363351515520.
The product of its (nonzero) digits is 944784, while the sum is 53.
The spelling of 113002321229999 in words is "one hundred thirteen trillion, two billion, three hundred twenty-one million, two hundred twenty-nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •