Base | Representation |
---|---|
bin | 11110010011111000011… |
… | …11010010000011110111 |
3 | 10200120012120220011220111 |
4 | 33021330033102003313 |
5 | 114030410403412201 |
6 | 2114235412443451 |
7 | 135146336621350 |
oct | 17117417220367 |
9 | 3616176804814 |
10 | 1041466466551 |
11 | 37175773aa65 |
12 | 149a15019587 |
13 | 772960cbc94 |
14 | 3859b6a8d27 |
15 | 1c156d71b51 |
hex | f27c3d20f7 |
1041466466551 has 4 divisors (see below), whose sum is σ = 1190247390352. Its totient is φ = 892685542752.
The previous prime is 1041466466489. The next prime is 1041466466563. The reversal of 1041466466551 is 1556646641401.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1041466466551 - 221 = 1041464369399 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1041466466495 and 1041466466504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1041464466551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 74390461890 + ... + 74390461903.
It is an arithmetic number, because the mean of its divisors is an integer number (297561847588).
Almost surely, 21041466466551 is an apocalyptic number.
1041466466551 is a deficient number, since it is larger than the sum of its proper divisors (148780923801).
1041466466551 is an equidigital number, since it uses as much as digits as its factorization.
1041466466551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148780923800.
The product of its (nonzero) digits is 2073600, while the sum is 49.
The spelling of 1041466466551 in words is "one trillion, forty-one billion, four hundred sixty-six million, four hundred sixty-six thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •