Base | Representation |
---|---|
bin | 100000000010001111000… |
… | …110111011000100010001 |
3 | 21210110021001001000101000 |
4 | 200002033012323010101 |
5 | 242032004044242431 |
6 | 4403153104532213 |
7 | 315022226026242 |
oct | 40021706730421 |
9 | 7713231030330 |
10 | 2201424212241 |
11 | 7796896387a1 |
12 | 2b6798621069 |
13 | 12c79395b787 |
14 | 78799b86cc9 |
15 | 3c3e64ca9e6 |
hex | 2008f1bb111 |
2201424212241 has 32 divisors (see below), whose sum is σ = 3267948992000. Its totient is φ = 1464657997824.
The previous prime is 2201424212231. The next prime is 2201424212287. The reversal of 2201424212241 is 1422124241022.
2201424212241 is a `hidden beast` number, since 2 + 2 + 0 + 1 + 424 + 212 + 24 + 1 = 666.
It is not a de Polignac number, because 2201424212241 - 214 = 2201424195857 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2201424212201) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 29508495 + ... + 29583003.
It is an arithmetic number, because the mean of its divisors is an integer number (102123406000).
Almost surely, 22201424212241 is an apocalyptic number.
It is an amenable number.
2201424212241 is a deficient number, since it is larger than the sum of its proper divisors (1066524779759).
2201424212241 is a wasteful number, since it uses less digits than its factorization.
2201424212241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76710 (or 76704 counting only the distinct ones).
The product of its (nonzero) digits is 4096, while the sum is 27.
Adding to 2201424212241 its reverse (1422124241022), we get a palindrome (3623548453263).
The spelling of 2201424212241 in words is "two trillion, two hundred one billion, four hundred twenty-four million, two hundred twelve thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •