Base | Representation |
---|---|
bin | 100100001011110… |
… | …0101101101101101 |
3 | 10010121121212112220 |
4 | 1020113211231231 |
5 | 4441310041331 |
6 | 320251145553 |
7 | 42042022335 |
oct | 11027455555 |
9 | 3117555486 |
10 | 1214143341 |
11 | 573396954 |
12 | 29a7452b9 |
13 | 164706c18 |
14 | b73720c5 |
15 | 718d1296 |
hex | 485e5b6d |
1214143341 has 8 divisors (see below), whose sum is σ = 1619339904. Its totient is φ = 809187840.
The previous prime is 1214143331. The next prime is 1214143361. The reversal of 1214143341 is 1433414121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1214143341 - 225 = 1180588909 is a prime.
It is a super-3 number, since 3×12141433413 (a number of 28 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1214143331) 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, 48165 + ... + 68906.
It is an arithmetic number, because the mean of its divisors is an integer number (202417488).
Almost surely, 21214143341 is an apocalyptic number.
It is an amenable number.
1214143341 is a deficient number, since it is larger than the sum of its proper divisors (405196563).
1214143341 is a wasteful number, since it uses less digits than its factorization.
1214143341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120531.
The product of its digits is 1152, while the sum is 24.
The square root of 1214143341 is about 34844.5597044933. The cubic root of 1214143341 is about 1066.8171468147.
Adding to 1214143341 its reverse (1433414121), we get a palindrome (2647557462).
The spelling of 1214143341 in words is "one billion, two hundred fourteen million, one hundred forty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •