Base | Representation |
---|---|
bin | 1001001001110001100011… |
… | …11000000000001010010100 |
3 | 2122021010102222001201110220 |
4 | 10210320301320000022110 |
5 | 10114230201144411424 |
6 | 110450123555514340 |
7 | 4145063102043120 |
oct | 444706170001224 |
9 | 78233388051426 |
10 | 20127053513364 |
11 | 645a920aa7146 |
12 | 23109115b89b0 |
13 | b2cc858bc645 |
14 | 4d8224290580 |
15 | 24d83e1c6579 |
hex | 124e31e00294 |
20127053513364 has 24 divisors (see below), whose sum is σ = 53672142702528. Its totient is φ = 5750586718080.
The previous prime is 20127053513317. The next prime is 20127053513381. The reversal of 20127053513364 is 46331535072102.
It is a happy number.
It is a super-2 number, since 2×201270535133642 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
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, 119803889877 + ... + 119803890044.
It is an arithmetic number, because the mean of its divisors is an integer number (2236339279272).
Almost surely, 220127053513364 is an apocalyptic number.
It is an amenable number.
20127053513364 is an abundant number, since it is smaller than the sum of its proper divisors (33545089189164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20127053513364 is a wasteful number, since it uses less digits than its factorization.
20127053513364 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 239607779935 (or 239607779933 counting only the distinct ones).
The product of its (nonzero) digits is 453600, while the sum is 42.
Adding to 20127053513364 its reverse (46331535072102), we get a palindrome (66458588585466).
The spelling of 20127053513364 in words is "twenty trillion, one hundred twenty-seven billion, fifty-three million, five hundred thirteen thousand, three hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •