Base | Representation |
---|---|
bin | 101001111110001… |
… | …1011001110110011 |
3 | 10122011001112210001 |
4 | 1103330123032303 |
5 | 10341014132412 |
6 | 351425450431 |
7 | 46620525034 |
oct | 12374331663 |
9 | 3564045701 |
10 | 1408349107 |
11 | 662a81590 |
12 | 3337a0a17 |
13 | 195a12a89 |
14 | d5086a8b |
15 | 83993957 |
hex | 53f1b3b3 |
1408349107 has 8 divisors (see below), whose sum is σ = 1537597440. Its totient is φ = 1279303560.
The previous prime is 1408349099. The next prime is 1408349209. The reversal of 1408349107 is 7019438041.
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 1408349107 - 23 = 1408349099 is a prime.
It is a super-4 number, since 4×14083491074 (a number of 38 digits) contains 4444 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1408341107) 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, 35983 + ... + 64120.
It is an arithmetic number, because the mean of its divisors is an integer number (192199680).
Almost surely, 21408349107 is an apocalyptic number.
1408349107 is a deficient number, since it is larger than the sum of its proper divisors (129248333).
1408349107 is a wasteful number, since it uses less digits than its factorization.
1408349107 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101393.
The product of its (nonzero) digits is 24192, while the sum is 37.
The square root of 1408349107 is about 37527.9776566764. The cubic root of 1408349107 is about 1120.9083582762.
It can be divided in two parts, 140834 and 9107, that added together give a palindrome (149941).
The spelling of 1408349107 in words is "one billion, four hundred eight million, three hundred forty-nine thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •