Base | Representation |
---|---|
bin | 10000001101001101110… |
… | …001011011110110100011 |
3 | 10221110122202112200011200 |
4 | 100031031301123312203 |
5 | 121221330020200220 |
6 | 2211343300412243 |
7 | 143314362101664 |
oct | 20151561336643 |
9 | 3843582480150 |
10 | 1113701334435 |
11 | 39a355407388 |
12 | 15ba143a7083 |
13 | 81038565861 |
14 | 3bc9103736b |
15 | 1de8378a890 |
hex | 1034dc5bda3 |
1113701334435 has 12 divisors (see below), whose sum is σ = 1930415646432. Its totient is φ = 593974045008.
The previous prime is 1113701334413. The next prime is 1113701334437. The reversal of 1113701334435 is 5344331073111.
1113701334435 is a `hidden beast` number, since 1 + 1 + 13 + 70 + 133 + 443 + 5 = 666.
It is not a de Polignac number, because 1113701334435 - 27 = 1113701334307 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1113701334435.
It is not an unprimeable number, because it can be changed into a prime (1113701334437) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 12374459227 + ... + 12374459316.
It is an arithmetic number, because the mean of its divisors is an integer number (160867970536).
Almost surely, 21113701334435 is an apocalyptic number.
1113701334435 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1113701334435 is a deficient number, since it is larger than the sum of its proper divisors (816714311997).
1113701334435 is a wasteful number, since it uses less digits than its factorization.
1113701334435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24748918554 (or 24748918551 counting only the distinct ones).
The product of its (nonzero) digits is 45360, while the sum is 36.
The spelling of 1113701334435 in words is "one trillion, one hundred thirteen billion, seven hundred one million, three hundred thirty-four thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •