Base | Representation |
---|---|
bin | 111101111100110100… |
… | …0101100110110100101 |
3 | 110201101120222202112111 |
4 | 1323321220230312211 |
5 | 4134430011341031 |
6 | 141041053121021 |
7 | 12416533445665 |
oct | 1737150546645 |
9 | 421346882474 |
10 | 133037215141 |
11 | 5146a048896 |
12 | 21949a89171 |
13 | c7121b915c |
14 | 66209dc1a5 |
15 | 36d98091b1 |
hex | 1ef9a2cda5 |
133037215141 has 4 divisors (see below), whose sum is σ = 133167772800. Its totient is φ = 132906657484.
The previous prime is 133037215123. The next prime is 133037215147. The reversal of 133037215141 is 141512730331.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 133037215141 - 25 = 133037215109 is a prime.
It is a super-2 number, since 2×1330372151412 (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 (133037215147) 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, 65277301 + ... + 65279338.
It is an arithmetic number, because the mean of its divisors is an integer number (33291943200).
Almost surely, 2133037215141 is an apocalyptic number.
It is an amenable number.
133037215141 is a deficient number, since it is larger than the sum of its proper divisors (130557659).
133037215141 is a wasteful number, since it uses less digits than its factorization.
133037215141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 130557658.
The product of its (nonzero) digits is 7560, while the sum is 31.
Adding to 133037215141 its reverse (141512730331), we get a palindrome (274549945472).
The spelling of 133037215141 in words is "one hundred thirty-three billion, thirty-seven million, two hundred fifteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •