Base | Representation |
---|---|
bin | 11101111110110000000… |
… | …00110001110100100101 |
3 | 10122110220220220022011212 |
4 | 32333120000301310211 |
5 | 113334142021011334 |
6 | 2105121533441205 |
7 | 134265236202311 |
oct | 16773000616445 |
9 | 3573826808155 |
10 | 1030121266469 |
11 | 367965666249 |
12 | 147789640205 |
13 | 761a880c139 |
14 | 37c02a1ab41 |
15 | 1bbe0d45ece |
hex | efd8031d25 |
1030121266469 has 2 divisors, whose sum is σ = 1030121266470. Its totient is φ = 1030121266468.
The previous prime is 1030121266453. The next prime is 1030121266477. The reversal of 1030121266469 is 9646621210301.
1030121266469 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 611583433444 + 418537833025 = 782038^2 + 646945^2 .
It is a cyclic number.
It is not a de Polignac number, because 1030121266469 - 24 = 1030121266453 is a prime.
It is a super-2 number, since 2×10301212664692 (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 (1030121266409) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515060633234 + 515060633235.
It is an arithmetic number, because the mean of its divisors is an integer number (515060633235).
Almost surely, 21030121266469 is an apocalyptic number.
It is an amenable number.
1030121266469 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030121266469 is an equidigital number, since it uses as much as digits as its factorization.
1030121266469 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 93312, while the sum is 41.
The spelling of 1030121266469 in words is "one trillion, thirty billion, one hundred twenty-one million, two hundred sixty-six thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •