Base | Representation |
---|---|
bin | 11110001111100111001000… |
… | …111111010011111111111011 |
3 | 122102222000221021212021010022 |
4 | 132033213020333103333323 |
5 | 114413301102320330021 |
6 | 1150521515245441055 |
7 | 40005650141006432 |
oct | 3617471077237773 |
9 | 572860837767108 |
10 | 133014214230011 |
11 | 39423014294334 |
12 | 12b0306727018b |
13 | 592b256bc127a |
14 | 24bbccabb6119 |
15 | 105a011b3b1ab |
hex | 78f9c8fd3ffb |
133014214230011 has 4 divisors (see below), whose sum is σ = 140014962347400. Its totient is φ = 126013466112624.
The previous prime is 133014214229957. The next prime is 133014214230047. The reversal of 133014214230011 is 110032412410331.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 133014214230011 - 218 = 133014213967867 is a prime.
It is a super-2 number, since 2×1330142142300112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (133014214230511) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3500374058666 + ... + 3500374058703.
It is an arithmetic number, because the mean of its divisors is an integer number (35003740586850).
Almost surely, 2133014214230011 is an apocalyptic number.
133014214230011 is a deficient number, since it is larger than the sum of its proper divisors (7000748117389).
133014214230011 is an equidigital number, since it uses as much as digits as its factorization.
133014214230011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7000748117388.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 133014214230011 its reverse (110032412410331), we get a palindrome (243046626640342).
The spelling of 133014214230011 in words is "one hundred thirty-three trillion, fourteen billion, two hundred fourteen million, two hundred thirty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •