Base | Representation |
---|---|
bin | 11111100011010101010… |
… | …10000000000111101111 |
3 | 10211122022021012211000111 |
4 | 33301222222000013233 |
5 | 120230240003412111 |
6 | 2150012142440451 |
7 | 141216350522656 |
oct | 17615252000757 |
9 | 3748267184014 |
10 | 1084121154031 |
11 | 388856145aa3 |
12 | 156139b93127 |
13 | 7b303161326 |
14 | 3a68667219d |
15 | 1d30193ca21 |
hex | fc6aa801ef |
1084121154031 has 2 divisors, whose sum is σ = 1084121154032. Its totient is φ = 1084121154030.
The previous prime is 1084121153971. The next prime is 1084121154037. The reversal of 1084121154031 is 1304511214801.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (1304511214801) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1084121154031 - 29 = 1084121153519 is a prime.
It is a super-2 number, since 2×10841211540312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1084121153984 and 1084121154002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1084121154037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 542060577015 + 542060577016.
It is an arithmetic number, because the mean of its divisors is an integer number (542060577016).
Almost surely, 21084121154031 is an apocalyptic number.
1084121154031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1084121154031 is an equidigital number, since it uses as much as digits as its factorization.
1084121154031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3840, while the sum is 31.
Adding to 1084121154031 its reverse (1304511214801), we get a palindrome (2388632368832).
The spelling of 1084121154031 in words is "one trillion, eighty-four billion, one hundred twenty-one million, one hundred fifty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •