Base | Representation |
---|---|
bin | 111101111100111111… |
… | …1111000011101100001 |
3 | 110201102000102111102101 |
4 | 1323321333320131201 |
5 | 4134433040321001 |
6 | 141041431250401 |
7 | 12416636215534 |
oct | 1737177703541 |
9 | 421360374371 |
10 | 133043292001 |
11 | 51472519494 |
12 | 2194bb19a01 |
13 | c713536129 |
14 | 6621740a1b |
15 | 36da109a01 |
hex | 1ef9ff8761 |
133043292001 has 3 divisors (see below), whose sum is σ = 133043656753. Its totient is φ = 133042927250.
The previous prime is 133043291959. The next prime is 133043292037. The reversal of 133043292001 is 100292340331.
The square root of 133043292001 is 364751.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 100292340331 = 4513 ⋅22222987.
It is not a de Polignac number, because 133043292001 - 219 = 133042767713 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133043292401) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 182376 + ... + 547126.
Almost surely, 2133043292001 is an apocalyptic number.
133043292001 is the 364751-st square number.
133043292001 is the 182376-th centered octagonal number.
It is an amenable number.
133043292001 is a deficient number, since it is larger than the sum of its proper divisors (364752).
133043292001 is an frugal number, since it uses more digits than its factorization.
133043292001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 729502 (or 364751 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 28.
The spelling of 133043292001 in words is "one hundred thirty-three billion, forty-three million, two hundred ninety-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •