Base | Representation |
---|---|
bin | 1001010001110001111101… |
… | …00011011011101111100001 |
3 | 2200020102111111121001220021 |
4 | 10220320332203123233201 |
5 | 10133232042344211230 |
6 | 111220340550313441 |
7 | 4204002102524533 |
oct | 450707643335741 |
9 | 80212444531807 |
10 | 20402144132065 |
11 | 6556556530603 |
12 | 23560a4958881 |
13 | b4cbb5bc2477 |
14 | 50767d0b7853 |
15 | 255a8eb12c7a |
hex | 128e3e8dbbe1 |
20402144132065 has 8 divisors (see below), whose sum is σ = 24482672838720. Its totient is φ = 16321648718832.
The previous prime is 20402144132057. The next prime is 20402144132087. The reversal of 20402144132065 is 56023144120402.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20402144132065 - 23 = 20402144132057 is a prime.
It is a super-2 number, since 2×204021441320652 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20402144132065.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6954739 + ... + 9443128.
It is an arithmetic number, because the mean of its divisors is an integer number (3060334104840).
Almost surely, 220402144132065 is an apocalyptic number.
It is an amenable number.
20402144132065 is a deficient number, since it is larger than the sum of its proper divisors (4080528706655).
20402144132065 is a wasteful number, since it uses less digits than its factorization.
20402144132065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16646711.
The product of its (nonzero) digits is 46080, while the sum is 34.
Adding to 20402144132065 its reverse (56023144120402), we get a palindrome (76425288252467).
The spelling of 20402144132065 in words is "twenty trillion, four hundred two billion, one hundred forty-four million, one hundred thirty-two thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •