Base | Representation |
---|---|
bin | 1111010110100100… |
… | …1011110101011111 |
3 | 101122012210101012210 |
4 | 3311221023311133 |
5 | 31420012324203 |
6 | 1520535531503 |
7 | 204061513023 |
oct | 36551136537 |
9 | 11565711183 |
10 | 4121214303 |
11 | 1825355338 |
12 | 970229b93 |
13 | 508a8225b |
14 | 2b14a8383 |
15 | 191c1a803 |
hex | f5a4bd5f |
4121214303 has 8 divisors (see below), whose sum is σ = 5499428400. Its totient is φ = 2745238208.
The previous prime is 4121214277. The next prime is 4121214311. The reversal of 4121214303 is 3034121214.
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 4121214303 - 25 = 4121214271 is a prime.
It is an alternating number because its digits alternate between even and odd.
It is a self number, because there is not a number n which added to its sum of digits gives 4121214303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4121214353) 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, 555198 + ... + 562571.
It is an arithmetic number, because the mean of its divisors is an integer number (687428550).
Almost surely, 24121214303 is an apocalyptic number.
4121214303 is a deficient number, since it is larger than the sum of its proper divisors (1378214097).
4121214303 is a wasteful number, since it uses less digits than its factorization.
4121214303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1119001.
The product of its (nonzero) digits is 576, while the sum is 21.
The square root of 4121214303 is about 64196.6845171929. The cubic root of 4121214303 is about 1603.2763985480.
Adding to 4121214303 its reverse (3034121214), we get a palindrome (7155335517).
The spelling of 4121214303 in words is "four billion, one hundred twenty-one million, two hundred fourteen thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •