Base | Representation |
---|---|
bin | 101010011100010… |
… | …1010101111110111 |
3 | 10200020202212121012 |
4 | 1110320222233313 |
5 | 10404040010203 |
6 | 353152142435 |
7 | 50202000314 |
oct | 12470525767 |
9 | 3606685535 |
10 | 1424141303 |
11 | 670988492 |
12 | 338b37a1b |
13 | 199081b80 |
14 | d71d7d0b |
15 | 85062bd8 |
hex | 54e2abf7 |
1424141303 has 8 divisors (see below), whose sum is σ = 1536502128. Its totient is φ = 1312182144.
The previous prime is 1424141239. The next prime is 1424141387. The reversal of 1424141303 is 3031414241.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1424141303 - 26 = 1424141239 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 (1424141503) 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, 93026 + ... + 107247.
It is an arithmetic number, because the mean of its divisors is an integer number (192062766).
Almost surely, 21424141303 is an apocalyptic number.
1424141303 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1424141303 is a deficient number, since it is larger than the sum of its proper divisors (112360825).
1424141303 is a wasteful number, since it uses less digits than its factorization.
1424141303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200833.
The product of its (nonzero) digits is 1152, while the sum is 23.
The square root of 1424141303 is about 37737.7967427883. The cubic root of 1424141303 is about 1125.0824770479.
Adding to 1424141303 its reverse (3031414241), we get a palindrome (4455555544).
The spelling of 1424141303 in words is "one billion, four hundred twenty-four million, one hundred forty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •