Base | Representation |
---|---|
bin | 10100011010000111111… |
… | …010000001111000000001 |
3 | 11222001221102021221122021 |
4 | 110122013322001320001 |
5 | 140434144001142224 |
6 | 2552134413041441 |
7 | 203215520563111 |
oct | 24320772017001 |
9 | 4861842257567 |
10 | 1402439474689 |
11 | 4a0853581780 |
12 | 1a7976186281 |
13 | a2332134216 |
14 | 4bc425c3041 |
15 | 267323d21e4 |
hex | 14687e81e01 |
1402439474689 has 8 divisors (see below), whose sum is σ = 1610456813280. Its totient is φ = 1207842609600.
The previous prime is 1402439474671. The next prime is 1402439474699. The reversal of 1402439474689 is 9864749342041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1402439474689 - 213 = 1402439466497 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1402439474699) 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 7 ways as a sum of consecutive naturals, for example, 3355118152 + ... + 3355118569.
It is an arithmetic number, because the mean of its divisors is an integer number (201307101660).
Almost surely, 21402439474689 is an apocalyptic number.
1402439474689 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
1402439474689 is a deficient number, since it is larger than the sum of its proper divisors (208017338591).
1402439474689 is a wasteful number, since it uses less digits than its factorization.
1402439474689 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6710236751.
The product of its (nonzero) digits is 41803776, while the sum is 61.
The spelling of 1402439474689 in words is "one trillion, four hundred two billion, four hundred thirty-nine million, four hundred seventy-four thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •