Base | Representation |
---|---|
bin | 11110000110000001101… |
… | …10000011011001101011 |
3 | 10122212000011020212121122 |
4 | 33003000312003121223 |
5 | 113420142022434334 |
6 | 2111005314525455 |
7 | 134464111060103 |
oct | 17030066033153 |
9 | 3585004225548 |
10 | 1034027546219 |
11 | 36958a658018 |
12 | 14849989688b |
13 | 7667bba8485 |
14 | 38093736203 |
15 | 1bd6dc5732e |
hex | f0c0d8366b |
1034027546219 has 2 divisors, whose sum is σ = 1034027546220. Its totient is φ = 1034027546218.
The previous prime is 1034027546143. The next prime is 1034027546281. The reversal of 1034027546219 is 9126457204301.
It is a strong prime.
It is an emirp because it is prime and its reverse (9126457204301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1034027546219 - 216 = 1034027480683 is a prime.
It is a super-2 number, since 2×10340275462192 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1034027546219.
It is not a weakly prime, because it can be changed into another prime (1034027516219) 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, 517013773109 + 517013773110.
It is an arithmetic number, because the mean of its divisors is an integer number (517013773110).
Almost surely, 21034027546219 is an apocalyptic number.
1034027546219 is a deficient number, since it is larger than the sum of its proper divisors (1).
1034027546219 is an equidigital number, since it uses as much as digits as its factorization.
1034027546219 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 362880, while the sum is 44.
The spelling of 1034027546219 in words is "one trillion, thirty-four billion, twenty-seven million, five hundred forty-six thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •