Base | Representation |
---|---|
bin | 111101111111000001… |
… | …0010010110100010110 |
3 | 110201120201220002202100 |
4 | 1323332002102310112 |
5 | 4140102411024420 |
6 | 141052251222530 |
7 | 12421421053506 |
oct | 1737602226426 |
9 | 421521802670 |
10 | 133111033110 |
11 | 514a7787380 |
12 | 2196a747a46 |
13 | c724593723 |
14 | 662a735a06 |
15 | 36e103b190 |
hex | 1efe092d16 |
133111033110 has 96 divisors (see below), whose sum is σ = 377626523040. Its totient is φ = 32262912000.
The previous prime is 133111033109. The next prime is 133111033193. The reversal of 133111033110 is 11330111331.
133111033110 is a `hidden beast` number, since 1 + 3 + 311 + 10 + 331 + 10 = 666.
It is a super-2 number, since 2×1331110331102 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6612060 + ... + 6632160.
It is an arithmetic number, because the mean of its divisors is an integer number (3933609615).
Almost surely, 2133111033110 is an apocalyptic number.
133111033110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
133111033110 is an abundant number, since it is smaller than the sum of its proper divisors (244515489930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133111033110 is a wasteful number, since it uses less digits than its factorization.
133111033110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26814 (or 26811 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 18.
Adding to 133111033110 its reverse (11330111331), we get a palindrome (144441144441).
The spelling of 133111033110 in words is "one hundred thirty-three billion, one hundred eleven million, thirty-three thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.164 sec. • engine limits •