Base | Representation |
---|---|
bin | 10001110000101000000… |
… | …110000111101011100111 |
3 | 11022200011210120200120202 |
4 | 101300220012013223213 |
5 | 124443432002430111 |
6 | 2332355225421115 |
7 | 154113503530664 |
oct | 21605006075347 |
9 | 4280153520522 |
10 | 1220443405031 |
11 | 430650537954 |
12 | 17864403a79b |
13 | 8b119ac0586 |
14 | 430d9672a6b |
15 | 21b2e840b3b |
hex | 11c28187ae7 |
1220443405031 has 2 divisors, whose sum is σ = 1220443405032. Its totient is φ = 1220443405030.
The previous prime is 1220443405009. The next prime is 1220443405081. The reversal of 1220443405031 is 1305043440221.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1220443405031 is a prime.
It is a super-2 number, since 2×12204434050312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1220443404985 and 1220443405003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1220443405001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 610221702515 + 610221702516.
It is an arithmetic number, because the mean of its divisors is an integer number (610221702516).
Almost surely, 21220443405031 is an apocalyptic number.
1220443405031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1220443405031 is an equidigital number, since it uses as much as digits as its factorization.
1220443405031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11520, while the sum is 29.
Adding to 1220443405031 its reverse (1305043440221), we get a palindrome (2525486845252).
The spelling of 1220443405031 in words is "one trillion, two hundred twenty billion, four hundred forty-three million, four hundred five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •