Base | Representation |
---|---|
bin | 1001001100001100100111… |
… | …10111110100101101010100 |
3 | 2122120002022200210122012012 |
4 | 10212012103313310231110 |
5 | 10122111144303342434 |
6 | 110552252400043352 |
7 | 4154101060441001 |
oct | 446062367645524 |
9 | 78502280718165 |
10 | 20210302012244 |
11 | 6492160671543 |
12 | 2324a85303558 |
13 | b37a91a44036 |
14 | 4dc28063a8a8 |
15 | 250ab29733ce |
hex | 126193df4b54 |
20210302012244 has 6 divisors (see below), whose sum is σ = 35368028521434. Its totient is φ = 10105151006120.
The previous prime is 20210302012139. The next prime is 20210302012253. The reversal of 20210302012244 is 44221020301202.
It can be written as a sum of positive squares in only one way, i.e., 13915973689744 + 6294328322500 = 3730412^2 + 2508850^2 .
It is a super-2 number, since 2×202103020122442 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2526287751527 + ... + 2526287751534.
It is an arithmetic number, because the mean of its divisors is an integer number (5894671420239).
Almost surely, 220210302012244 is an apocalyptic number.
It is an amenable number.
20210302012244 is a deficient number, since it is larger than the sum of its proper divisors (15157726509190).
20210302012244 is a wasteful number, since it uses less digits than its factorization.
20210302012244 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5052575503065 (or 5052575503063 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 23.
Adding to 20210302012244 its reverse (44221020301202), we get a palindrome (64431322313446).
The spelling of 20210302012244 in words is "twenty trillion, two hundred ten billion, three hundred two million, twelve thousand, two hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •