Base | Representation |
---|---|
bin | 100000110110010… |
… | …1110000110100101 |
3 | 2211211001201001200 |
4 | 1001230232012211 |
5 | 4224133222323 |
6 | 301212513113 |
7 | 36212622102 |
oct | 10154560645 |
9 | 2754051050 |
10 | 1102242213 |
11 | 516206986 |
12 | 26917b799 |
13 | 147487437 |
14 | a6563aa9 |
15 | 66b7a443 |
hex | 41b2e1a5 |
1102242213 has 12 divisors (see below), whose sum is σ = 1592454240. Its totient is φ = 734677416.
The previous prime is 1102242199. The next prime is 1102242217. The reversal of 1102242213 is 3122422011.
It is a happy number.
It is not a de Polignac number, because 1102242213 - 220 = 1101193637 is a prime.
It is a super-2 number, since 2×11022422132 = 2429875792238274738, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102242217) 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, 50320 + ... + 68822.
It is an arithmetic number, because the mean of its divisors is an integer number (132704520).
Almost surely, 21102242213 is an apocalyptic number.
It is an amenable number.
1102242213 is a deficient number, since it is larger than the sum of its proper divisors (490212027).
1102242213 is a wasteful number, since it uses less digits than its factorization.
1102242213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25128 (or 25125 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
The square root of 1102242213 is about 33200.0333282965. The cubic root of 1102242213 is about 1032.9810309121.
Adding to 1102242213 its reverse (3122422011), we get a palindrome (4224664224).
It can be divided in two parts, 11022 and 42213, that added together give a palindrome (53235).
The spelling of 1102242213 in words is "one billion, one hundred two million, two hundred forty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •