Base | Representation |
---|---|
bin | 101010000101100… |
… | …1111011110011001 |
3 | 10122102100212122010 |
4 | 1110023033132121 |
5 | 10343012424423 |
6 | 352045020133 |
7 | 46665532464 |
oct | 12413173631 |
9 | 3572325563 |
10 | 1412233113 |
11 | 665194705 |
12 | 334b54649 |
13 | 1967728c5 |
14 | d57b82db |
15 | 83eae693 |
hex | 542cf799 |
1412233113 has 8 divisors (see below), whose sum is σ = 1886422048. Its totient is φ = 939766464.
The previous prime is 1412233099. The next prime is 1412233157. The reversal of 1412233113 is 3113322141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1412233113 - 210 = 1412232089 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1412233113.
It is not an unprimeable number, because it can be changed into a prime (1412233183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 428656 + ... + 431937.
It is an arithmetic number, because the mean of its divisors is an integer number (235802756).
Almost surely, 21412233113 is an apocalyptic number.
It is an amenable number.
1412233113 is a deficient number, since it is larger than the sum of its proper divisors (474188935).
1412233113 is an equidigital number, since it uses as much as digits as its factorization.
1412233113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 861143.
The product of its digits is 432, while the sum is 21.
The square root of 1412233113 is about 37579.6901663651. The cubic root of 1412233113 is about 1121.9378422993.
Adding to 1412233113 its reverse (3113322141), we get a palindrome (4525555254).
The spelling of 1412233113 in words is "one billion, four hundred twelve million, two hundred thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •