Base | Representation |
---|---|
bin | 101101101110011010111100… |
… | …011111111001000010010000 |
3 | 222101001011201121010110101111 |
4 | 231232122330133321002100 |
5 | 202324324121012210000 |
6 | 1551413012235543104 |
7 | 60234102015115003 |
oct | 5556327437710220 |
9 | 871034647113344 |
10 | 201102121210000 |
11 | 59093a2677985a |
12 | 1a67ab315baa94 |
13 | 8829b056700aa |
14 | 3793574ad953a |
15 | 183b1dad96cba |
hex | b6e6bc7f9090 |
201102121210000 has 50 divisors (see below), whose sum is σ = 486888345685742. Its totient is φ = 80440848480000.
The previous prime is 201102121209943. The next prime is 201102121210021. The reversal of 201102121210000 is 12121201102.
It can be written as a sum of positive squares in 5 ways, for example, as 46852875047056 + 154249246162944 = 6844916^2 + 12419712^2 .
It is a tau number, because it is divible by the number of its divisors (50).
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 10055096061 + ... + 10055116060.
Almost surely, 2201102121210000 is an apocalyptic number.
201102121210000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201102121210000 is an abundant number, since it is smaller than the sum of its proper divisors (285786224475742).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201102121210000 is an equidigital number, since it uses as much as digits as its factorization.
201102121210000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20110212149 (or 20110212128 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 201102121210000 its reverse (12121201102), we get a palindrome (201114242411102).
The spelling of 201102121210000 in words is "two hundred one trillion, one hundred two billion, one hundred twenty-one million, two hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •