Base | Representation |
---|---|
bin | 11110010010110100001111… |
… | …101110110010000010000110 |
3 | 122110202002101111210121211210 |
4 | 132102310033232302002012 |
5 | 114430403120232123024 |
6 | 1151211020410512250 |
7 | 40030604510446122 |
oct | 3622641756620206 |
9 | 573662344717753 |
10 | 133234444411014 |
11 | 394a8457500991 |
12 | 12b39889a35686 |
13 | 5945c534ab83b |
14 | 24c881d97a582 |
15 | 1060b01148129 |
hex | 792d0fbb2086 |
133234444411014 has 8 divisors (see below), whose sum is σ = 266468888822040. Its totient is φ = 44411481470336.
The previous prime is 133234444410971. The next prime is 133234444411021. The reversal of 133234444411014 is 410114444432331.
It is a sphenic number, since it is the product of 3 distinct primes.
133234444411014 is an admirable number.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 11102870367579 + ... + 11102870367590.
It is an arithmetic number, because the mean of its divisors is an integer number (33308611102755).
Almost surely, 2133234444411014 is an apocalyptic number.
133234444411014 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133234444411014 is a wasteful number, since it uses less digits than its factorization.
133234444411014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22205740735174.
The product of its (nonzero) digits is 221184, while the sum is 39.
Adding to 133234444411014 its reverse (410114444432331), we get a palindrome (543348888843345).
The spelling of 133234444411014 in words is "one hundred thirty-three trillion, two hundred thirty-four billion, four hundred forty-four million, four hundred eleven thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •