Base | Representation |
---|---|
bin | 11101110101101000000… |
… | …00111101010110110001 |
3 | 10122000021111202101222111 |
4 | 32322310000331112301 |
5 | 113244123411213031 |
6 | 2102551453205321 |
7 | 134032652221444 |
oct | 16726400752661 |
9 | 3560244671874 |
10 | 1025222366641 |
11 | 365881331300 |
12 | 146840a90841 |
13 | 758a78baa45 |
14 | 3789a15565b |
15 | 1ba05c101b1 |
hex | eeb403d5b1 |
1025222366641 has 6 divisors (see below), whose sum is σ = 1126897312226. Its totient is φ = 932020333200.
The previous prime is 1025222366639. The next prime is 1025222366669. The reversal of 1025222366641 is 1466632225201.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 681732600241 + 343489766400 = 825671^2 + 586080^2 .
It is not a de Polignac number, because 1025222366641 - 21 = 1025222366639 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1025222366594 and 1025222366603.
It is not an unprimeable number, because it can be changed into a prime (1025222366041) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 4236455940 + ... + 4236456181.
Almost surely, 21025222366641 is an apocalyptic number.
1025222366641 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1025222366641 is a deficient number, since it is larger than the sum of its proper divisors (101674945585).
1025222366641 is an equidigital number, since it uses as much as digits as its factorization.
1025222366641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8472912143 (or 8472912132 counting only the distinct ones).
The product of its (nonzero) digits is 207360, while the sum is 40.
The spelling of 1025222366641 in words is "one trillion, twenty-five billion, two hundred twenty-two million, three hundred sixty-six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •