Base | Representation |
---|---|
bin | 10000100000010010011… |
… | …001110001100001000100 |
3 | 11000102111221222101101120 |
4 | 100200102121301201010 |
5 | 122040300102044302 |
6 | 2225011331553540 |
7 | 144641016614112 |
oct | 20402231614104 |
9 | 4012457871346 |
10 | 1134180112452 |
11 | 3a8004118412 |
12 | 16398a75b8b0 |
13 | 82c501a4b9a |
14 | 3cc74b4cab2 |
15 | 1e78157b9bc |
hex | 10812671844 |
1134180112452 has 48 divisors (see below), whose sum is σ = 2725160868864. Its totient is φ = 366907936000.
The previous prime is 1134180112397. The next prime is 1134180112459. The reversal of 1134180112452 is 2542110814311.
It is not an unprimeable number, because it can be changed into a prime (1134180112459) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5940699 + ... + 6128642.
It is an arithmetic number, because the mean of its divisors is an integer number (56774184768).
Almost surely, 21134180112452 is an apocalyptic number.
1134180112452 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1134180112452 is an abundant number, since it is smaller than the sum of its proper divisors (1590980756412).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1134180112452 is a wasteful number, since it uses less digits than its factorization.
1134180112452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12069580 (or 12069578 counting only the distinct ones).
The product of its (nonzero) digits is 7680, while the sum is 33.
Adding to 1134180112452 its reverse (2542110814311), we get a palindrome (3676290926763).
The spelling of 1134180112452 in words is "one trillion, one hundred thirty-four billion, one hundred eighty million, one hundred twelve thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •