Base | Representation |
---|---|
bin | 1001010111111001011010… |
… | …10011111001111001000100 |
3 | 2200222111222012110020122001 |
4 | 10223330231103321321010 |
5 | 10200203001402333314 |
6 | 111501055204515044 |
7 | 4225122133156162 |
oct | 453745523717104 |
9 | 80874865406561 |
10 | 20612308246084 |
11 | 66276a3709035 |
12 | 238a9783aba84 |
13 | b66969bccc99 |
14 | 5138d903c232 |
15 | 25b290561674 |
hex | 12bf2d4f9e44 |
20612308246084 has 27 divisors (see below), whose sum is σ = 36151405306653. Its totient is φ = 10283385631872.
The previous prime is 20612308246051. The next prime is 20612308246121. The reversal of 20612308246084 is 48064280321602.
The square root of 20612308246084 is 4540078.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 9133624900 + 20603174621184 = 95570^2 + 4539072^2 .
It is a Smith number, since the sum of its digits (46) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 4567316212 + ... + 4567320724.
Almost surely, 220612308246084 is an apocalyptic number.
20612308246084 is the 4540078-th square number.
It is an amenable number.
20612308246084 is a deficient number, since it is larger than the sum of its proper divisors (15539097060569).
20612308246084 is an frugal number, since it uses more digits than its factorization.
20612308246084 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10036 (or 5018 counting only the distinct ones).
The product of its (nonzero) digits is 884736, while the sum is 46.
Adding to 20612308246084 its reverse (48064280321602), we get a palindrome (68676588567686).
The spelling of 20612308246084 in words is "twenty trillion, six hundred twelve billion, three hundred eight million, two hundred forty-six thousand, eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •