Base | Representation |
---|---|
bin | 10000100110110110110… |
… | …111011010101101110100 |
3 | 11001002201120200221212021 |
4 | 100212312313122231310 |
5 | 122144221441022400 |
6 | 2232135324002524 |
7 | 145310564420506 |
oct | 20466667325564 |
9 | 4032646627767 |
10 | 1141234314100 |
11 | 3aaaa4022531 |
12 | 165219090444 |
13 | 838057a77ba |
14 | 3d343977d76 |
15 | 1ea45a0071a |
hex | 109b6ddab74 |
1141234314100 has 36 divisors (see below), whose sum is σ = 2606819437600. Its totient is φ = 432467739360.
The previous prime is 1141234314089. The next prime is 1141234314109. The reversal of 1141234314100 is 14134321411.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1141234314109) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 300322920 + ... + 300326719.
Almost surely, 21141234314100 is an apocalyptic number.
1141234314100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1141234314100 is an abundant number, since it is smaller than the sum of its proper divisors (1465585123500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1141234314100 is a wasteful number, since it uses less digits than its factorization.
1141234314100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 600649672 (or 600649665 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 1141234314100 its reverse (14134321411), we get a palindrome (1155368635511).
The spelling of 1141234314100 in words is "one trillion, one hundred forty-one billion, two hundred thirty-four million, three hundred fourteen thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •