Base | Representation |
---|---|
bin | 1111010110100100… |
… | …1011000111010111 |
3 | 101122012210020011110 |
4 | 3311221023013113 |
5 | 31420012230401 |
6 | 1520535510103 |
7 | 204061501305 |
oct | 36551130727 |
9 | 11565706143 |
10 | 4121211351 |
11 | 18253530a4 |
12 | 970228333 |
13 | 508a80aca |
14 | 2b14a7275 |
15 | 191c199d6 |
hex | f5a4b1d7 |
4121211351 has 8 divisors (see below), whose sum is σ = 5496688624. Its totient is φ = 2746604160.
The previous prime is 4121211337. The next prime is 4121211371. The reversal of 4121211351 is 1531121214.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4121211351 - 25 = 4121211319 is a prime.
It is a super-2 number, since 2×41212113512 = 33968765999222490402, 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 (4121211371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 206386 + ... + 225471.
It is an arithmetic number, because the mean of its divisors is an integer number (687086078).
Almost surely, 24121211351 is an apocalyptic number.
4121211351 is a deficient number, since it is larger than the sum of its proper divisors (1375477273).
4121211351 is a wasteful number, since it uses less digits than its factorization.
4121211351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 435041.
The product of its digits is 240, while the sum is 21.
The square root of 4121211351 is about 64196.6615253473. The cubic root of 4121211351 is about 1603.2760157423.
Adding to 4121211351 its reverse (1531121214), we get a palindrome (5652332565).
The spelling of 4121211351 in words is "four billion, one hundred twenty-one million, two hundred eleven thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •