Base | Representation |
---|---|
bin | 1000001111101001… |
… | …1001100100101101 |
3 | 12201020101100221021 |
4 | 2003322121210231 |
5 | 14013024440042 |
6 | 1003334534141 |
7 | 105562150501 |
oct | 20372314455 |
9 | 5636340837 |
10 | 2213124397 |
11 | a36284130 |
12 | 519207351 |
13 | 293678383 |
14 | 16dcd6301 |
15 | ce460867 |
hex | 83e9992d |
2213124397 has 8 divisors (see below), whose sum is σ = 2455238880. Its totient is φ = 1977830160.
The previous prime is 2213124383. The next prime is 2213124437. The reversal of 2213124397 is 7934213122.
2213124397 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2213124397 - 27 = 2213124269 is a prime.
It is a super-2 number, since 2×22131243972 = 9795839193193227218, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2213124307) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1704378 + ... + 1705675.
It is an arithmetic number, because the mean of its divisors is an integer number (306904860).
Almost surely, 22213124397 is an apocalyptic number.
It is an amenable number.
2213124397 is a deficient number, since it is larger than the sum of its proper divisors (242114483).
2213124397 is a wasteful number, since it uses less digits than its factorization.
2213124397 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3410123.
The product of its digits is 18144, while the sum is 34.
The square root of 2213124397 is about 47043.8561025773. The cubic root of 2213124397 is about 1303.1726055042.
The spelling of 2213124397 in words is "two billion, two hundred thirteen million, one hundred twenty-four thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •