Base | Representation |
---|---|
bin | 11110010011110010100111… |
… | …110010111000011100001111 |
3 | 122110222111021011102202222122 |
4 | 132103302213302320130033 |
5 | 114433002302023211421 |
6 | 1151301454345003155 |
7 | 40035465312623120 |
oct | 3623624762703417 |
9 | 573874234382878 |
10 | 133301420132111 |
11 | 395238a655a500 |
12 | 12b4a85ba834bb |
13 | 594c3681c0a3a |
14 | 24cbb74a6a047 |
15 | 1062720ebb2ab |
hex | 793ca7cb870f |
133301420132111 has 48 divisors (see below), whose sum is σ = 168915487141632. Its totient is φ = 102967873367040.
The previous prime is 133301420132029. The next prime is 133301420132131. The reversal of 133301420132111 is 111231024103331.
It is not a de Polignac number, because 133301420132111 - 230 = 133300346390287 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133301420132131) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 44821580 + ... + 47703006.
It is an arithmetic number, because the mean of its divisors is an integer number (3519072648784).
Almost surely, 2133301420132111 is an apocalyptic number.
133301420132111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
133301420132111 is a deficient number, since it is larger than the sum of its proper divisors (35614067009521).
133301420132111 is a wasteful number, since it uses less digits than its factorization.
133301420132111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2881932 (or 2881921 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 26.
Adding to 133301420132111 its reverse (111231024103331), we get a palindrome (244532444235442).
The spelling of 133301420132111 in words is "one hundred thirty-three trillion, three hundred one billion, four hundred twenty million, one hundred thirty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •