Base | Representation |
---|---|
bin | 1000000011001101001… |
… | …1001010010000100001 |
3 | 111012222100010022222212 |
4 | 2000303103022100201 |
5 | 4231214200123431 |
6 | 143311200411505 |
7 | 12664123216265 |
oct | 2006323122041 |
9 | 435870108885 |
10 | 138299614241 |
11 | 5371a588158 |
12 | 22978316b95 |
13 | 1007050bc89 |
14 | 699d8860a5 |
15 | 38e67e372b |
hex | 20334ca421 |
138299614241 has 4 divisors (see below), whose sum is σ = 138378240000. Its totient is φ = 138220988484.
The previous prime is 138299614231. The next prime is 138299614247. The reversal of 138299614241 is 142416992831.
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 138299614241 - 210 = 138299613217 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 138299614241.
It is not an unprimeable number, because it can be changed into a prime (138299614247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 39310241 + ... + 39313758.
It is an arithmetic number, because the mean of its divisors is an integer number (34594560000).
Almost surely, 2138299614241 is an apocalyptic number.
It is an amenable number.
138299614241 is a deficient number, since it is larger than the sum of its proper divisors (78625759).
138299614241 is an equidigital number, since it uses as much as digits as its factorization.
138299614241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78625758.
The product of its digits is 746496, while the sum is 50.
The spelling of 138299614241 in words is "one hundred thirty-eight billion, two hundred ninety-nine million, six hundred fourteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •