Base | Representation |
---|---|
bin | 10110111111001100101110… |
… | …010011010111101011101100 |
3 | 111020222001210122222110221102 |
4 | 112333030232103113223230 |
5 | 101222410311033311340 |
6 | 555004412045422232 |
7 | 30203143355021066 |
oct | 2677145623275354 |
9 | 436861718873842 |
10 | 101100012010220 |
11 | 2a239302120673 |
12 | b409a3956a978 |
13 | 44548c8567a52 |
14 | 1ad73a3b24736 |
15 | ba4c9b344215 |
hex | 5bf32e4d7aec |
101100012010220 has 12 divisors (see below), whose sum is σ = 212310025221504. Its totient is φ = 40440004804080.
The previous prime is 101100012010169. The next prime is 101100012010373. The reversal of 101100012010220 is 22010210001101.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2527500300236 + ... + 2527500300275.
It is an arithmetic number, because the mean of its divisors is an integer number (17692502101792).
Almost surely, 2101100012010220 is an apocalyptic number.
101100012010220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101100012010220 is an abundant number, since it is smaller than the sum of its proper divisors (111210013211284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101100012010220 is a wasteful number, since it uses less digits than its factorization.
101100012010220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5055000600520 (or 5055000600518 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101100012010220 its reverse (22010210001101), we get a palindrome (123110222011321).
The spelling of 101100012010220 in words is "one hundred one trillion, one hundred billion, twelve million, ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •