Base | Representation |
---|---|
bin | 101001110011000… |
… | …0101000001011001 |
3 | 10121202000220220222 |
4 | 1103212011001121 |
5 | 10333014202334 |
6 | 351100125425 |
7 | 46516655645 |
oct | 12346050131 |
9 | 3552026828 |
10 | 1402490969 |
11 | 65a740250 |
12 | 331836875 |
13 | 194741519 |
14 | d439dc25 |
15 | 831d7d2e |
hex | 53985059 |
1402490969 has 4 divisors (see below), whose sum is σ = 1529990160. Its totient is φ = 1274991780.
The previous prime is 1402490917. The next prime is 1402490981. The reversal of 1402490969 is 9690942041.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1402490969 - 212 = 1402486873 is a prime.
It is a super-2 number, since 2×14024909692 = 3933961836253117922, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1402490269) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 63749579 + ... + 63749600.
It is an arithmetic number, because the mean of its divisors is an integer number (382497540).
Almost surely, 21402490969 is an apocalyptic number.
It is an amenable number.
1402490969 is a deficient number, since it is larger than the sum of its proper divisors (127499191).
1402490969 is a wasteful number, since it uses less digits than its factorization.
1402490969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127499190.
The product of its (nonzero) digits is 139968, while the sum is 44.
The square root of 1402490969 is about 37449.8460477476. The cubic root of 1402490969 is about 1119.3520297950.
The spelling of 1402490969 in words is "one billion, four hundred two million, four hundred ninety thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •