Base | Representation |
---|---|
bin | 11110010111001101110… |
… | …00000001001010010001 |
3 | 10200201211021100000202111 |
4 | 33023212320001022101 |
5 | 114043041403431004 |
6 | 2115133122345321 |
7 | 135241562456221 |
oct | 17134670011221 |
9 | 3621737300674 |
10 | 1043255530129 |
11 | 3724956049aa |
12 | 14a2341bb241 |
13 | 774bc960197 |
14 | 386cb136081 |
15 | 1c20de69a04 |
hex | f2e6e01291 |
1043255530129 has 2 divisors, whose sum is σ = 1043255530130. Its totient is φ = 1043255530128.
The previous prime is 1043255530127. The next prime is 1043255530159. The reversal of 1043255530129 is 9210355523401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 592715214400 + 450540315729 = 769880^2 + 671223^2 .
It is a cyclic number.
It is not a de Polignac number, because 1043255530129 - 21 = 1043255530127 is a prime.
It is a super-2 number, since 2×10432555301292 (a number of 25 digits) contains 22 as substring.
Together with 1043255530127, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1043255530091 and 1043255530100.
It is not a weakly prime, because it can be changed into another prime (1043255530127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 521627765064 + 521627765065.
It is an arithmetic number, because the mean of its divisors is an integer number (521627765065).
Almost surely, 21043255530129 is an apocalyptic number.
It is an amenable number.
1043255530129 is a deficient number, since it is larger than the sum of its proper divisors (1).
1043255530129 is an equidigital number, since it uses as much as digits as its factorization.
1043255530129 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 162000, while the sum is 40.
The spelling of 1043255530129 in words is "one trillion, forty-three billion, two hundred fifty-five million, five hundred thirty thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •