Base | Representation |
---|---|
bin | 11110000110000000111… |
… | …01000101100001000001 |
3 | 10122211222200221100122112 |
4 | 33003000131011201001 |
5 | 113420133334020111 |
6 | 2111004522345105 |
7 | 134464001330462 |
oct | 17030035054101 |
9 | 3584880840575 |
10 | 1034021001281 |
11 | 369586997784 |
12 | 14849765b195 |
13 | 7667a726428 |
14 | 38092910d69 |
15 | 1bd6d3b2e8b |
hex | f0c0745841 |
1034021001281 has 2 divisors, whose sum is σ = 1034021001282. Its totient is φ = 1034021001280.
The previous prime is 1034021001269. The next prime is 1034021001329. The reversal of 1034021001281 is 1821001204301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1017241685056 + 16779316225 = 1008584^2 + 129535^2 .
It is an emirp because it is prime and its reverse (1821001204301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1034021001281 - 26 = 1034021001217 is a prime.
It is a super-2 number, since 2×10340210012812 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1034021007281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 517010500640 + 517010500641.
It is an arithmetic number, because the mean of its divisors is an integer number (517010500641).
Almost surely, 21034021001281 is an apocalyptic number.
It is an amenable number.
1034021001281 is a deficient number, since it is larger than the sum of its proper divisors (1).
1034021001281 is an equidigital number, since it uses as much as digits as its factorization.
1034021001281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 1034021001281 its reverse (1821001204301), we get a palindrome (2855022205582).
The spelling of 1034021001281 in words is "one trillion, thirty-four billion, twenty-one million, one thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •