Base | Representation |
---|---|
bin | 10000100000100110011… |
… | …000100010011111101100 |
3 | 11000110101022202100200010 |
4 | 100200212120202133230 |
5 | 122041441411124400 |
6 | 2225104504533220 |
7 | 144652230134562 |
oct | 20404630423754 |
9 | 4013338670603 |
10 | 1134515333100 |
11 | 3a8166368676 |
12 | 163a62a81210 |
13 | 82ca4784cb6 |
14 | 3cca748da32 |
15 | 1e7a0be6450 |
hex | 108266227ec |
1134515333100 has 72 divisors (see below), whose sum is σ = 3311580076560. Its totient is φ = 299860090880.
The previous prime is 1134515333089. The next prime is 1134515333113. The reversal of 1134515333100 is 13335154311.
It is a super-2 number, since 2×11345153331002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 16699365 + ... + 16767164.
It is an arithmetic number, because the mean of its divisors is an integer number (45994167730).
Almost surely, 21134515333100 is an apocalyptic number.
1134515333100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1134515333100 is an abundant number, since it is smaller than the sum of its proper divisors (2177064743460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1134515333100 is a wasteful number, since it uses less digits than its factorization.
1134515333100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33466659 (or 33466652 counting only the distinct ones).
The product of its (nonzero) digits is 8100, while the sum is 30.
The spelling of 1134515333100 in words is "one trillion, one hundred thirty-four billion, five hundred fifteen million, three hundred thirty-three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •