Base | Representation |
---|---|
bin | 111101111110111010… |
… | …0111100111111101101 |
3 | 110201120111022102102022 |
4 | 1323331310330333231 |
5 | 4140101012121403 |
6 | 141052044235525 |
7 | 12421346246435 |
oct | 1737564747755 |
9 | 421514272368 |
10 | 133107535853 |
11 | 514a5808886 |
12 | 2196953bba5 |
13 | c72393a946 |
14 | 662a0a52c5 |
15 | 36e0a99d38 |
hex | 1efdd3cfed |
133107535853 has 4 divisors (see below), whose sum is σ = 136705036860. Its totient is φ = 129510034848.
The previous prime is 133107535837. The next prime is 133107535889. The reversal of 133107535853 is 358535701331.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 125597233609 + 7510302244 = 354397^2 + 86662^2 .
It is a cyclic number.
It is not a de Polignac number, because 133107535853 - 24 = 133107535837 is a prime.
It is a super-2 number, since 2×1331075358532 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133107535453) 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, 1798750448 + ... + 1798750521.
It is an arithmetic number, because the mean of its divisors is an integer number (34176259215).
Almost surely, 2133107535853 is an apocalyptic number.
It is an amenable number.
133107535853 is a deficient number, since it is larger than the sum of its proper divisors (3597501007).
133107535853 is an equidigital number, since it uses as much as digits as its factorization.
133107535853 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3597501006.
The product of its (nonzero) digits is 567000, while the sum is 44.
The spelling of 133107535853 in words is "one hundred thirty-three billion, one hundred seven million, five hundred thirty-five thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •