Base | Representation |
---|---|
bin | 11101111110110000000… |
… | …00110001110100101101 |
3 | 10122110220220220022012011 |
4 | 32333120000301310231 |
5 | 113334142021011402 |
6 | 2105121533441221 |
7 | 134265236202322 |
oct | 16773000616455 |
9 | 3573826808164 |
10 | 1030121266477 |
11 | 367965666256 |
12 | 147789640211 |
13 | 761a880c144 |
14 | 37c02a1ab49 |
15 | 1bbe0d45ed7 |
hex | efd8031d2d |
1030121266477 has 2 divisors, whose sum is σ = 1030121266478. Its totient is φ = 1030121266476.
The previous prime is 1030121266469. The next prime is 1030121266481. The reversal of 1030121266477 is 7746621210301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 840877996036 + 189243270441 = 916994^2 + 435021^2 .
It is a cyclic number.
It is not a de Polignac number, because 1030121266477 - 23 = 1030121266469 is a prime.
It is a super-2 number, since 2×10301212664772 (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 (1030121566477) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515060633238 + 515060633239.
It is an arithmetic number, because the mean of its divisors is an integer number (515060633239).
Almost surely, 21030121266477 is an apocalyptic number.
It is an amenable number.
1030121266477 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030121266477 is an equidigital number, since it uses as much as digits as its factorization.
1030121266477 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84672, while the sum is 40.
Adding to 1030121266477 its reverse (7746621210301), we get a palindrome (8776742476778).
The spelling of 1030121266477 in words is "one trillion, thirty billion, one hundred twenty-one million, two hundred sixty-six thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •