Base | Representation |
---|---|
bin | 111110000110010001… |
… | …0110111100101010011 |
3 | 110202012200221010112002 |
4 | 1330030202313211103 |
5 | 4141102220001311 |
6 | 141132344424215 |
7 | 12430435102451 |
oct | 1741442674523 |
9 | 422180833462 |
10 | 133354453331 |
11 | 51612126610 |
12 | 21a1817806b |
13 | c762b41268 |
14 | 6650bbb9d1 |
15 | 37075c093b |
hex | 1f0c8b7953 |
133354453331 has 4 divisors (see below), whose sum is σ = 145477585464. Its totient is φ = 121231321200.
The previous prime is 133354453321. The next prime is 133354453343.
133354453331 is nontrivially palindromic in base 10.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 133354453331 - 210 = 133354452307 is a prime.
It is a super-2 number, since 2×1333544533312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133354453321) 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, 6061566050 + ... + 6061566071.
It is an arithmetic number, because the mean of its divisors is an integer number (36369396366).
Almost surely, 2133354453331 is an apocalyptic number.
133354453331 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
133354453331 is a deficient number, since it is larger than the sum of its proper divisors (12123132133).
133354453331 is a wasteful number, since it uses less digits than its factorization.
133354453331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12123132132.
The product of its digits is 291600, while the sum is 38.
It can be divided in two parts, 133354 and 453331, that added together give a palindrome (586685).
The spelling of 133354453331 in words is "one hundred thirty-three billion, three hundred fifty-four million, four hundred fifty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •