Base | Representation |
---|---|
bin | 1001010001110000000001… |
… | …01111000111100000011101 |
3 | 2200020022211020001200110222 |
4 | 10220320000233013200131 |
5 | 10133222431343220032 |
6 | 111220050021211125 |
7 | 4203634310233025 |
oct | 450700057074035 |
9 | 80208736050428 |
10 | 20401107007517 |
11 | 6556074060585 |
12 | 2355a55560aa5 |
13 | b4ca7c0874c2 |
14 | 5075c1464a85 |
15 | 255a2da4ba12 |
hex | 128e00bc781d |
20401107007517 has 2 divisors, whose sum is σ = 20401107007518. Its totient is φ = 20401107007516.
The previous prime is 20401107007487. The next prime is 20401107007597. The reversal of 20401107007517 is 71570070110402.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19285149288196 + 1115957719321 = 4391486^2 + 1056389^2 .
It is a cyclic number.
It is not a de Polignac number, because 20401107007517 - 26 = 20401107007453 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20401107007597) 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, 10200553503758 + 10200553503759.
It is an arithmetic number, because the mean of its divisors is an integer number (10200553503759).
Almost surely, 220401107007517 is an apocalyptic number.
It is an amenable number.
20401107007517 is a deficient number, since it is larger than the sum of its proper divisors (1).
20401107007517 is an equidigital number, since it uses as much as digits as its factorization.
20401107007517 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13720, while the sum is 35.
Adding to 20401107007517 its reverse (71570070110402), we get a palindrome (91971177117919).
The spelling of 20401107007517 in words is "twenty trillion, four hundred one billion, one hundred seven million, seven thousand, five hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •