Base | Representation |
---|---|
bin | 11110001111011010111100… |
… | …000010010100101001011001 |
3 | 122102220210010011201200211110 |
4 | 132033122330002110221121 |
5 | 114413042234133412101 |
6 | 1150511511203450533 |
7 | 40005004354005252 |
oct | 3617327402245131 |
9 | 572823104650743 |
10 | 133001112013401 |
11 | 39418500444045 |
12 | 12b0060b386a49 |
13 | 5929c495b0b88 |
14 | 24bb406a3db29 |
15 | 10599e6747cd6 |
hex | 78f6bc094a59 |
133001112013401 has 4 divisors (see below), whose sum is σ = 177334816017872. Its totient is φ = 88667408008932.
The previous prime is 133001112013391. The next prime is 133001112013409. The reversal of 133001112013401 is 104310211100331.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 133001112013401 - 25 = 133001112013369 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133001112013409) 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, 22166852002231 + ... + 22166852002236.
It is an arithmetic number, because the mean of its divisors is an integer number (44333704004468).
Almost surely, 2133001112013401 is an apocalyptic number.
It is an amenable number.
133001112013401 is a deficient number, since it is larger than the sum of its proper divisors (44333704004471).
133001112013401 is an equidigital number, since it uses as much as digits as its factorization.
133001112013401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44333704004470.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 133001112013401 its reverse (104310211100331), we get a palindrome (237311323113732).
The spelling of 133001112013401 in words is "one hundred thirty-three trillion, one billion, one hundred twelve million, thirteen thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •