Base | Representation |
---|---|
bin | 111111010000001… |
… | …111010000011001 |
3 | 2201221212122002100 |
4 | 333100033100121 |
5 | 4133133041101 |
6 | 253145354013 |
7 | 35204142642 |
oct | 7720172031 |
9 | 2657778070 |
10 | 1061221401 |
11 | 4a5039389 |
12 | 257498909 |
13 | 13bb24076 |
14 | a0d266c9 |
15 | 63275e86 |
hex | 3f40f419 |
1061221401 has 12 divisors (see below), whose sum is σ = 1537272100. Its totient is φ = 705451680.
The previous prime is 1061221393. The next prime is 1061221411. The reversal of 1061221401 is 1041221601.
1061221401 is a `hidden beast` number, since 10 + 612 + 2 + 1 + 40 + 1 = 666.
1061221401 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 303595776 + 757625625 = 17424^2 + 27525^2 .
It is not a de Polignac number, because 1061221401 - 23 = 1061221393 is a prime.
It is a super-2 number, since 2×10612214012 = 2252381723880805602, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1061221411) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 165790 + ... + 172071.
Almost surely, 21061221401 is an apocalyptic number.
It is an amenable number.
1061221401 is a deficient number, since it is larger than the sum of its proper divisors (476050699).
1061221401 is a wasteful number, since it uses less digits than its factorization.
1061221401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 338216 (or 338213 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
The square root of 1061221401 is about 32576.3933086522. The cubic root of 1061221401 is about 1020.0042935229.
The spelling of 1061221401 in words is "one billion, sixty-one million, two hundred twenty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •