Base | Representation |
---|---|
bin | 111101111101000001… |
… | …0101000001000100001 |
3 | 110201102001210001110110 |
4 | 1323322002220020201 |
5 | 4134433231332203 |
6 | 141041454521533 |
7 | 12416645303415 |
oct | 1737202501041 |
9 | 421361701413 |
10 | 133044011553 |
11 | 51472970062 |
12 | 219502062a9 |
13 | c7137287bb |
14 | 662188ad45 |
15 | 36da1ecd03 |
hex | 1efa0a8221 |
133044011553 has 8 divisors (see below), whose sum is σ = 177667899808. Its totient is φ = 88558065504.
The previous prime is 133044011537. The next prime is 133044011561. The reversal of 133044011553 is 355110440331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 133044011553 - 24 = 133044011537 is a prime.
It is a super-2 number, since 2×1330440115532 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
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 133044011553.
It is not an unprimeable number, because it can be changed into a prime (133044011563) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34483300 + ... + 34487157.
It is an arithmetic number, because the mean of its divisors is an integer number (22208487476).
Almost surely, 2133044011553 is an apocalyptic number.
It is an amenable number.
133044011553 is a deficient number, since it is larger than the sum of its proper divisors (44623888255).
133044011553 is an equidigital number, since it uses as much as digits as its factorization.
133044011553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68971103.
The product of its (nonzero) digits is 10800, while the sum is 30.
Adding to 133044011553 its reverse (355110440331), we get a palindrome (488154451884).
The spelling of 133044011553 in words is "one hundred thirty-three billion, forty-four million, eleven thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •