Base | Representation |
---|---|
bin | 10110111111100000011101… |
… | …110111111001100111101100 |
3 | 111021001002112002000102022222 |
4 | 112333200131313321213230 |
5 | 101223232220032211340 |
6 | 555022235414054512 |
7 | 30204523611161645 |
oct | 2677403567714754 |
9 | 437032462012288 |
10 | 101121211210220 |
11 | 2a2472a055a373 |
12 | b411b7504a438 |
13 | 44568c6516986 |
14 | 1ad84153ac6cc |
15 | ba55dc4dd8b5 |
hex | 5bf81ddf99ec |
101121211210220 has 12 divisors (see below), whose sum is σ = 212354543541504. Its totient is φ = 40448484484080.
The previous prime is 101121211210213. The next prime is 101121211210223. The reversal of 101121211210220 is 22012112121101.
It is not an unprimeable number, because it can be changed into a prime (101121211210223) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2528030280236 + ... + 2528030280275.
It is an arithmetic number, because the mean of its divisors is an integer number (17696211961792).
Almost surely, 2101121211210220 is an apocalyptic number.
101121211210220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101121211210220 is an abundant number, since it is smaller than the sum of its proper divisors (111233332331284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101121211210220 is a wasteful number, since it uses less digits than its factorization.
101121211210220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5056060560520 (or 5056060560518 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 101121211210220 its reverse (22012112121101), we get a palindrome (123133323331321).
The spelling of 101121211210220 in words is "one hundred one trillion, one hundred twenty-one billion, two hundred eleven million, two hundred ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •