Base | Representation |
---|---|
bin | 10000100000100000001… |
… | …011110011100110110101 |
3 | 11000110010002001120000022 |
4 | 100200200023303212311 |
5 | 122041233300111041 |
6 | 2225050311454525 |
7 | 144646525136462 |
oct | 20404013634665 |
9 | 4013102046008 |
10 | 1134411332021 |
11 | 3a8112694070 |
12 | 163a34087445 |
13 | 82c890702b6 |
14 | 3cc9773a669 |
15 | 1e796a0124b |
hex | 108202f39b5 |
1134411332021 has 16 divisors (see below), whose sum is σ = 1295177689728. Its totient is φ = 983517427200.
The previous prime is 1134411332009. The next prime is 1134411332057. The reversal of 1134411332021 is 1202331144311.
It is a de Polignac number, because none of the positive numbers 2k-1134411332021 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1134411332071) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 6567320 + ... + 6737841.
It is an arithmetic number, because the mean of its divisors is an integer number (80948605608).
Almost surely, 21134411332021 is an apocalyptic number.
1134411332021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1134411332021 is a deficient number, since it is larger than the sum of its proper divisors (160766357707).
1134411332021 is a wasteful number, since it uses less digits than its factorization.
1134411332021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13305532.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 1134411332021 its reverse (1202331144311), we get a palindrome (2336742476332).
The spelling of 1134411332021 in words is "one trillion, one hundred thirty-four billion, four hundred eleven million, three hundred thirty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •