Base | Representation |
---|---|
bin | 11001110100001001101101… |
… | …010111101000110101000010 |
3 | 112212222211200101111002202220 |
4 | 121310021231113220311002 |
5 | 104340124140101244204 |
6 | 1041245131550551510 |
7 | 32625430102340214 |
oct | 3164115527506502 |
9 | 485884611432686 |
10 | 113535000415554 |
11 | 331a2a17979633 |
12 | 10897a15b08596 |
13 | 4b473c6289c93 |
14 | 20071a26345b4 |
15 | d1d48c69d1d9 |
hex | 67426d5e8d42 |
113535000415554 has 8 divisors (see below), whose sum is σ = 227070000831120. Its totient is φ = 37845000138516.
The previous prime is 113535000415439. The next prime is 113535000415579. The reversal of 113535000415554 is 455514000535311.
It is a sphenic number, since it is the product of 3 distinct primes.
113535000415554 is an admirable number.
It is a super-3 number, since 3×1135350004155543 (a number of 43 digits) contains 333 as substring.
It is a Curzon number.
It is an unprimeable number.
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, 9461250034624 + ... + 9461250034635.
It is an arithmetic number, because the mean of its divisors is an integer number (28383750103890).
Almost surely, 2113535000415554 is an apocalyptic number.
113535000415554 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.
113535000415554 is a wasteful number, since it uses less digits than its factorization.
113535000415554 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18922500069264.
The product of its (nonzero) digits is 450000, while the sum is 42.
The spelling of 113535000415554 in words is "one hundred thirteen trillion, five hundred thirty-five billion, four hundred fifteen thousand, five hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •