Base | Representation |
---|---|
bin | 1000001000001110101… |
… | …1101111101110010001 |
3 | 111100110022210102211221 |
4 | 2002003223233232101 |
5 | 4241444422031213 |
6 | 144053054205041 |
7 | 13042420265356 |
oct | 2020353575621 |
9 | 440408712757 |
10 | 139648236433 |
11 | 54251874a52 |
12 | 23093ab3781 |
13 | 10226a3c184 |
14 | 6a8aa2262d |
15 | 3974dda38d |
hex | 2083aefb91 |
139648236433 has 2 divisors, whose sum is σ = 139648236434. Its totient is φ = 139648236432.
The previous prime is 139648236367. The next prime is 139648236437. The reversal of 139648236433 is 334632846931.
139648236433 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 127351200769 + 12297035664 = 356863^2 + 110892^2 .
It is an emirp because it is prime and its reverse (334632846931) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 139648236433 - 213 = 139648228241 is a prime.
It is not a weakly prime, because it can be changed into another prime (139648236437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69824118216 + 69824118217.
It is an arithmetic number, because the mean of its divisors is an integer number (69824118217).
Almost surely, 2139648236433 is an apocalyptic number.
It is an amenable number.
139648236433 is a deficient number, since it is larger than the sum of its proper divisors (1).
139648236433 is an equidigital number, since it uses as much as digits as its factorization.
139648236433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6718464, while the sum is 52.
The spelling of 139648236433 in words is "one hundred thirty-nine billion, six hundred forty-eight million, two hundred thirty-six thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •