Base | Representation |
---|---|
bin | 10001110110111011011… |
… | …100100011000001001101 |
3 | 11100022122102001211210000 |
4 | 101312323130203001031 |
5 | 130101311342032341 |
6 | 2335434524034513 |
7 | 154443264104214 |
oct | 21667334430115 |
9 | 4308572054700 |
10 | 1227210502221 |
11 | 433503376160 |
12 | 179a12392a39 |
13 | 8b957a8bbb2 |
14 | 4357c2c407b |
15 | 21dc89a18b6 |
hex | 11dbb72304d |
1227210502221 has 40 divisors (see below), whose sum is σ = 2000540672064. Its totient is φ = 743525153280.
The previous prime is 1227210502187. The next prime is 1227210502277. The reversal of 1227210502221 is 1222050127221.
1227210502221 is a `hidden beast` number, since 1 + 227 + 210 + 5 + 0 + 2 + 221 = 666.
It is not a de Polignac number, because 1227210502221 - 210 = 1227210501197 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1227210509221) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 2575536 + ... + 3014598.
Almost surely, 21227210502221 is an apocalyptic number.
1227210502221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1227210502221 is a deficient number, since it is larger than the sum of its proper divisors (773330169843).
1227210502221 is a wasteful number, since it uses less digits than its factorization.
1227210502221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 442223 (or 442214 counting only the distinct ones).
The product of its (nonzero) digits is 2240, while the sum is 27.
Adding to 1227210502221 its reverse (1222050127221), we get a palindrome (2449260629442).
The spelling of 1227210502221 in words is "one trillion, two hundred twenty-seven billion, two hundred ten million, five hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •