Base | Representation |
---|---|
bin | 1001001001010111110011… |
… | …00000110010001110111100 |
3 | 2122012210202002111220020222 |
4 | 10210223321200302032330 |
5 | 10114013340042013040 |
6 | 110435515340000512 |
7 | 4144063262450522 |
oct | 444537140621674 |
9 | 78183662456228 |
10 | 20113223001020 |
11 | 6454a74040556 |
12 | 230a0b1830138 |
13 | b2b890443826 |
14 | 4d76b14d6312 |
15 | 24d2cedc1bb5 |
hex | 124af98323bc |
20113223001020 has 12 divisors (see below), whose sum is σ = 42237768302184. Its totient is φ = 8045289200400.
The previous prime is 20113223000993. The next prime is 20113223001059. The reversal of 20113223001020 is 2010032231102.
It is a self number, because there is not a number n which added to its sum of digits gives 20113223001020.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 502830575006 + ... + 502830575045.
It is an arithmetic number, because the mean of its divisors is an integer number (3519814025182).
Almost surely, 220113223001020 is an apocalyptic number.
20113223001020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20113223001020 is an abundant number, since it is smaller than the sum of its proper divisors (22124545301164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20113223001020 is a wasteful number, since it uses less digits than its factorization.
20113223001020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1005661150060 (or 1005661150058 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 20113223001020 its reverse (2010032231102), we get a palindrome (22123255232122).
The spelling of 20113223001020 in words is "twenty trillion, one hundred thirteen billion, two hundred twenty-three million, one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •