Base | Representation |
---|---|
bin | 111110011000000111… |
… | …1000110110111000001 |
3 | 110210202102200021222020 |
4 | 1330300033012313001 |
5 | 4143314013042201 |
6 | 141312015032053 |
7 | 12451325601504 |
oct | 1746017066701 |
9 | 423672607866 |
10 | 133953252801 |
11 | 5189a134505 |
12 | 21b6480b629 |
13 | c829c09584 |
14 | 66aa53113b |
15 | 373ee52a36 |
hex | 1f303c6dc1 |
133953252801 has 24 divisors (see below), whose sum is σ = 184804290720. Its totient is φ = 86303136960.
The previous prime is 133953252799. The next prime is 133953252803. The reversal of 133953252801 is 108252359331.
It is an interprime number because it is at equal distance from previous prime (133953252799) and next prime (133953252803).
It is not a de Polignac number, because 133953252801 - 21 = 133953252799 is a prime.
It is a super-2 number, since 2×1339532528012 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (133953252803) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2099101 + ... + 2161973.
It is an arithmetic number, because the mean of its divisors is an integer number (7700178780).
Almost surely, 2133953252801 is an apocalyptic number.
It is an amenable number.
133953252801 is a deficient number, since it is larger than the sum of its proper divisors (50851037919).
133953252801 is an equidigital number, since it uses as much as digits as its factorization.
133953252801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63677 (or 63646 counting only the distinct ones).
The product of its (nonzero) digits is 194400, while the sum is 42.
The spelling of 133953252801 in words is "one hundred thirty-three billion, nine hundred fifty-three million, two hundred fifty-two thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •