Base | Representation |
---|---|
bin | 1111110011001011… |
… | …1001100100000101 |
3 | 101221120120100120211 |
4 | 3330302321210011 |
5 | 32141221421123 |
6 | 1540503355421 |
7 | 210046421461 |
oct | 37462714405 |
9 | 11846510524 |
10 | 4241201413 |
11 | 1887058439 |
12 | 9a4452b71 |
13 | 5278a3347 |
14 | 2c33bd4a1 |
15 | 19c51c40d |
hex | fccb9905 |
4241201413 has 16 divisors (see below), whose sum is σ = 4592332800. Its totient is φ = 3903847920.
The previous prime is 4241201399. The next prime is 4241201423. The reversal of 4241201413 is 3141021424.
It is a happy number.
It is not a de Polignac number, because 4241201413 - 213 = 4241193221 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4241201423) 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, 142458 + ... + 169636.
It is an arithmetic number, because the mean of its divisors is an integer number (287020800).
Almost surely, 24241201413 is an apocalyptic number.
4241201413 is a gapful number since it is divisible by the number (43) formed by its first and last digit.
It is an amenable number.
4241201413 is a deficient number, since it is larger than the sum of its proper divisors (351131387).
4241201413 is a wasteful number, since it uses less digits than its factorization.
4241201413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27432.
The product of its (nonzero) digits is 768, while the sum is 22.
The square root of 4241201413 is about 65124.5070077310. The cubic root of 4241201413 is about 1618.6873242023.
Adding to 4241201413 its reverse (3141021424), we get a palindrome (7382222837).
The spelling of 4241201413 in words is "four billion, two hundred forty-one million, two hundred one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •