Base | Representation |
---|---|
bin | 111110001010001001… |
… | …1110001100111111001 |
3 | 110202112210001002020102 |
4 | 1330110103301213321 |
5 | 4141334041330424 |
6 | 141153320405145 |
7 | 12433606231550 |
oct | 1742423614771 |
9 | 422483032212 |
10 | 133484714489 |
11 | 51679706765 |
12 | 21a539167b5 |
13 | c783b1b879 |
14 | 6664208d97 |
15 | 3713c517ae |
hex | 1f144f19f9 |
133484714489 has 4 divisors (see below), whose sum is σ = 152553959424. Its totient is φ = 114415469556.
The previous prime is 133484714449. The next prime is 133484714513. The reversal of 133484714489 is 984417484331.
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, and also an emirpimes, since its reverse is a distinct semiprime: 984417484331 = 17 ⋅57906910843.
It is a cyclic number.
It is not a de Polignac number, because 133484714489 - 216 = 133484648953 is a prime.
It is a super-2 number, since 2×1334847144892 (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 (133484714449) 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, 9534622457 + ... + 9534622470.
It is an arithmetic number, because the mean of its divisors is an integer number (38138489856).
Almost surely, 2133484714489 is an apocalyptic number.
It is an amenable number.
133484714489 is a deficient number, since it is larger than the sum of its proper divisors (19069244935).
133484714489 is an equidigital number, since it uses as much as digits as its factorization.
133484714489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19069244934.
The product of its digits is 9289728, while the sum is 56.
The spelling of 133484714489 in words is "one hundred thirty-three billion, four hundred eighty-four million, seven hundred fourteen thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •