Base | Representation |
---|---|
bin | 101010000101100… |
… | …0111111101100101 |
3 | 10122102022022102102 |
4 | 1110023013331211 |
5 | 10343010433331 |
6 | 352044221445 |
7 | 46665343664 |
oct | 12413077545 |
9 | 3572268372 |
10 | 1412202341 |
11 | 665173580 |
12 | 334b3a885 |
13 | 1967618b4 |
14 | d57aaddb |
15 | 83ea54cb |
hex | 542c7f65 |
1412202341 has 16 divisors (see below), whose sum is σ = 1642214400. Its totient is φ = 1200841200.
The previous prime is 1412202293. The next prime is 1412202383. The reversal of 1412202341 is 1432022141.
It is a cyclic number.
It is not a de Polignac number, because 1412202341 - 230 = 338460517 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1412202391) 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 15 ways as a sum of consecutive naturals, for example, 26255 + ... + 59276.
It is an arithmetic number, because the mean of its divisors is an integer number (102638400).
Almost surely, 21412202341 is an apocalyptic number.
1412202341 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1412202341 is a deficient number, since it is larger than the sum of its proper divisors (230012059).
1412202341 is a wasteful number, since it uses less digits than its factorization.
1412202341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85640.
The product of its (nonzero) digits is 384, while the sum is 20.
The square root of 1412202341 is about 37579.2807408551. The cubic root of 1412202341 is about 1121.9296933798.
Adding to 1412202341 its reverse (1432022141), we get a palindrome (2844224482).
The spelling of 1412202341 in words is "one billion, four hundred twelve million, two hundred two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •