Base | Representation |
---|---|
bin | 1000000001101010001… |
… | …1000100001100000001 |
3 | 111011220101201220001022 |
4 | 2000122203010030001 |
5 | 4224341343301111 |
6 | 143202044115225 |
7 | 12650621444033 |
oct | 2003243041401 |
9 | 434811656038 |
10 | 137884353281 |
11 | 53527139484 |
12 | 22881235b15 |
13 | 1000548632c |
14 | 696066bc53 |
15 | 38c01182db |
hex | 201a8c4301 |
137884353281 has 4 divisors (see below), whose sum is σ = 141090966192. Its totient is φ = 134677740372.
The previous prime is 137884353193. The next prime is 137884353307. The reversal of 137884353281 is 182353488731.
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 137884353281 - 234 = 120704484097 is a prime.
It is a super-2 number, since 2×1378843532812 (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 (137884353181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1603306391 + ... + 1603306476.
It is an arithmetic number, because the mean of its divisors is an integer number (35272741548).
Almost surely, 2137884353281 is an apocalyptic number.
It is an amenable number.
137884353281 is a deficient number, since it is larger than the sum of its proper divisors (3206612911).
137884353281 is an equidigital number, since it uses as much as digits as its factorization.
137884353281 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3206612910.
The product of its digits is 3870720, while the sum is 53.
The spelling of 137884353281 in words is "one hundred thirty-seven billion, eight hundred eighty-four million, three hundred fifty-three thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •