Base | Representation |
---|---|
bin | 111110010001100000… |
… | …0011011110000000001 |
3 | 110210011222001001021001 |
4 | 1330203000123300001 |
5 | 4142340203134101 |
6 | 141234005532001 |
7 | 12442662213004 |
oct | 1744300336001 |
9 | 423158031231 |
10 | 133731302401 |
11 | 51795919924 |
12 | 21b02414001 |
13 | c7c2c38188 |
14 | 6688c7753b |
15 | 372a70e901 |
hex | 1f2301bc01 |
133731302401 has 8 divisors (see below), whose sum is σ = 135313660224. Its totient is φ = 132154009200.
The previous prime is 133731302399. The next prime is 133731302407. The reversal of 133731302401 is 104203137331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 133731302401 - 21 = 133731302399 is a prime.
It is a super-2 number, since 2×1337313024012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 133731302401.
It is not an unprimeable number, because it can be changed into a prime (133731302407) 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, 1213021 + ... + 1318666.
It is an arithmetic number, because the mean of its divisors is an integer number (16914207528).
Almost surely, 2133731302401 is an apocalyptic number.
It is an amenable number.
133731302401 is a deficient number, since it is larger than the sum of its proper divisors (1582357823).
133731302401 is a wasteful number, since it uses less digits than its factorization.
133731302401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2532311.
The product of its (nonzero) digits is 4536, while the sum is 28.
Adding to 133731302401 its reverse (104203137331), we get a palindrome (237934439732).
The spelling of 133731302401 in words is "one hundred thirty-three billion, seven hundred thirty-one million, three hundred two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •