Base | Representation |
---|---|
bin | 11110010001010100001101… |
… | …101101001011011001110110 |
3 | 122110101020020101010211220022 |
4 | 132101110031231023121312 |
5 | 114422210431243033420 |
6 | 1151051404513205142 |
7 | 40020264332006165 |
oct | 3621241555133166 |
9 | 573336211124808 |
10 | 133131331221110 |
11 | 39468753825172 |
12 | 12b218b15607b2 |
13 | 59392cca065c1 |
14 | 24c383b28b3dc |
15 | 105d0b895bc25 |
hex | 79150db4b676 |
133131331221110 has 8 divisors (see below), whose sum is σ = 239636396198016. Its totient is φ = 53252532488440.
The previous prime is 133131331221103. The next prime is 133131331221191. The reversal of 133131331221110 is 11122133131331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 133131331221110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6656566561046 + ... + 6656566561065.
It is an arithmetic number, because the mean of its divisors is an integer number (29954549524752).
Almost surely, 2133131331221110 is an apocalyptic number.
133131331221110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
133131331221110 is a deficient number, since it is larger than the sum of its proper divisors (106505064976906).
133131331221110 is a wasteful number, since it uses less digits than its factorization.
133131331221110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13313133122118.
The product of its (nonzero) digits is 972, while the sum is 26.
Adding to 133131331221110 its reverse (11122133131331), we get a palindrome (144253464352441).
The spelling of 133131331221110 in words is "one hundred thirty-three trillion, one hundred thirty-one billion, three hundred thirty-one million, two hundred twenty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •