Base | Representation |
---|---|
bin | 111110010111101110… |
… | …0110101000100100100 |
3 | 110210201111212200022211 |
4 | 1330233130311010210 |
5 | 4143302124311430 |
6 | 141310424333204 |
7 | 12451105555615 |
oct | 1745734650444 |
9 | 423644780284 |
10 | 133940072740 |
11 | 518927520a1 |
12 | 21b60314204 |
13 | c827273416 |
14 | 66a889dc0c |
15 | 373dbec72a |
hex | 1f2f735124 |
133940072740 has 12 divisors (see below), whose sum is σ = 281274152796. Its totient is φ = 53576029088.
The previous prime is 133940072731. The next prime is 133940072807. The reversal of 133940072740 is 47270049331.
It can be written as a sum of positive squares in 2 ways, for example, as 73710078016 + 60229994724 = 271496^2 + 245418^2 .
It is a super-2 number, since 2×1339400727402 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133940072693 and 133940072702.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3348501799 + ... + 3348501838.
It is an arithmetic number, because the mean of its divisors is an integer number (23439512733).
Almost surely, 2133940072740 is an apocalyptic number.
133940072740 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
133940072740 is an abundant number, since it is smaller than the sum of its proper divisors (147334080056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133940072740 is a wasteful number, since it uses less digits than its factorization.
133940072740 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6697003646 (or 6697003644 counting only the distinct ones).
The product of its (nonzero) digits is 127008, while the sum is 40.
The spelling of 133940072740 in words is "one hundred thirty-three billion, nine hundred forty million, seventy-two thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •