Base | Representation |
---|---|
bin | 11001101100110111011111… |
… | …010101010101111101111001 |
3 | 112211012222112202211021022100 |
4 | 121230313133111111331321 |
5 | 104303423423204234001 |
6 | 1040223142001214013 |
7 | 32544315556516020 |
oct | 3154673725257571 |
9 | 484188482737270 |
10 | 113034401243001 |
11 | 3301a690778a07 |
12 | 108169a8331309 |
13 | 4b0c137c73144 |
14 | 1dcac73a018b7 |
15 | d1043e162586 |
hex | 66cddf555f79 |
113034401243001 has 12 divisors (see below), whose sum is σ = 186596471893312. Its totient is φ = 64591086424536.
The previous prime is 113034401242963. The next prime is 113034401243011. The reversal of 113034401243001 is 100342104430311.
113034401243001 is a `hidden beast` number, since 1 + 1 + 3 + 0 + 344 + 0 + 12 + 4 + 300 + 1 = 666.
It is not a de Polignac number, because 113034401243001 - 242 = 108636354731897 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113034401243011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 897098422501 + ... + 897098422626.
Almost surely, 2113034401243001 is an apocalyptic number.
It is an amenable number.
113034401243001 is a deficient number, since it is larger than the sum of its proper divisors (73562070650311).
113034401243001 is a wasteful number, since it uses less digits than its factorization.
113034401243001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1794196845140 (or 1794196845137 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 113034401243001 its reverse (100342104430311), we get a palindrome (213376505673312).
The spelling of 113034401243001 in words is "one hundred thirteen trillion, thirty-four billion, four hundred one million, two hundred forty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •