Base | Representation |
---|---|
bin | 11100110100001001001… |
… | …11010010000100101111 |
3 | 10111122112111102110012122 |
4 | 32122010213102010233 |
5 | 112210124221240424 |
6 | 2034455231423155 |
7 | 131346535526645 |
oct | 16320447220457 |
9 | 3448474373178 |
10 | 990067368239 |
11 | 351981244714 |
12 | 13ba6b684abb |
13 | 72494538041 |
14 | 35cc321d195 |
15 | 1ab4976445e |
hex | e6849d212f |
990067368239 has 2 divisors, whose sum is σ = 990067368240. Its totient is φ = 990067368238.
The previous prime is 990067368211. The next prime is 990067368293. The reversal of 990067368239 is 932863760099.
Together with next prime (990067368293) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is an emirp because it is prime and its reverse (932863760099) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-990067368239 is a prime.
It is a super-2 number, since 2×9900673682392 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (990067368839) 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, 495033684119 + 495033684120.
It is an arithmetic number, because the mean of its divisors is an integer number (495033684120).
Almost surely, 2990067368239 is an apocalyptic number.
990067368239 is a deficient number, since it is larger than the sum of its proper divisors (1).
990067368239 is an equidigital number, since it uses as much as digits as its factorization.
990067368239 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26453952, while the sum is 62.
The spelling of 990067368239 in words is "nine hundred ninety billion, sixty-seven million, three hundred sixty-eight thousand, two hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •