Base | Representation |
---|---|
bin | 101010000011011… |
… | …1110000100000110 |
3 | 10122100020222102200 |
4 | 1110012332010012 |
5 | 10342221110342 |
6 | 352005015330 |
7 | 46653156501 |
oct | 12406760406 |
9 | 3570228380 |
10 | 1411113222 |
11 | 66459a282 |
12 | 3346b4546 |
13 | 19646cc4c |
14 | d55a6138 |
15 | 83d3c94c |
hex | 541be106 |
1411113222 has 24 divisors (see below), whose sum is σ = 3059767776. Its totient is φ = 470008656.
The previous prime is 1411113217. The next prime is 1411113251. The reversal of 1411113222 is 2223111141.
It is a super-3 number, since 3×14111132223 (a number of 28 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 1411113195 and 1411113204.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5653 + ... + 53424.
It is an arithmetic number, because the mean of its divisors is an integer number (127490324).
Almost surely, 21411113222 is an apocalyptic number.
1411113222 is an abundant number, since it is smaller than the sum of its proper divisors (1648654554).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1411113222 is a wasteful number, since it uses less digits than its factorization.
1411113222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60412 (or 60409 counting only the distinct ones).
The product of its digits is 96, while the sum is 18.
The square root of 1411113222 is about 37564.7869952699. The cubic root of 1411113222 is about 1121.6412009150.
Adding to 1411113222 its reverse (2223111141), we get a palindrome (3634224363).
The spelling of 1411113222 in words is "one billion, four hundred eleven million, one hundred thirteen thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •