Base | Representation |
---|---|
bin | 10110111101111010000111… |
… | …010000000101111101101100 |
3 | 111020122120211212112000002011 |
4 | 112331322013100011331230 |
5 | 101214432130330311340 |
6 | 554455542154011004 |
7 | 30163553266325101 |
oct | 2675720720057554 |
9 | 436576755460064 |
10 | 101011310010220 |
11 | 2a204724161155 |
12 | b3b4803416a64 |
13 | 444943063030c |
14 | 1ad2d8b386aa8 |
15 | ba2808e100ea |
hex | 5bde87405f6c |
101011310010220 has 36 divisors (see below), whose sum is σ = 223875759404304. Its totient is φ = 38277970106400.
The previous prime is 101011310010217. The next prime is 101011310010257. The reversal of 101011310010220 is 22010013110101.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 101011310010220.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6995235856 + ... + 6995250295.
It is an arithmetic number, because the mean of its divisors is an integer number (6218771094564).
Almost surely, 2101011310010220 is an apocalyptic number.
101011310010220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101011310010220 is an abundant number, since it is smaller than the sum of its proper divisors (122864449394084).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101011310010220 is a wasteful number, since it uses less digits than its factorization.
101011310010220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13990486198 (or 13990486177 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 101011310010220 its reverse (22010013110101), we get a palindrome (123021323120321).
The spelling of 101011310010220 in words is "one hundred one trillion, eleven billion, three hundred ten million, ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •