Base | Representation |
---|---|
bin | 1100111000010000… |
… | …11011001010100001 |
3 | 122211212201000000211 |
4 | 12130020123022201 |
5 | 103130042441114 |
6 | 3102040014121 |
7 | 333226420000 |
oct | 63410331241 |
9 | 18755630024 |
10 | 6914421409 |
11 | 2a29013165 |
12 | 140b761341 |
13 | 86267161c |
14 | 498440c37 |
15 | 2a70626c4 |
hex | 19c21b2a1 |
6914421409 has 15 divisors (see below), whose sum is σ = 8071101107. Its totient is φ = 5923154496.
The previous prime is 6914421389. The next prime is 6914421413. The reversal of 6914421409 is 9041244196.
The square root of 6914421409 is 83153.
It is a perfect power (a square), and thus also a powerful number.
6914421409 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 6656112225 + 258309184 = 81585^2 + 16072^2 .
It is not a de Polignac number, because 6914421409 - 219 = 6913897121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6914421109) by changing a digit.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 4073649 + ... + 4075345.
Almost surely, 26914421409 is an apocalyptic number.
6914421409 is the 83153-rd square number.
6914421409 is the 41577-th centered octagonal number.
It is an amenable number.
6914421409 is a deficient number, since it is larger than the sum of its proper divisors (1156679698).
6914421409 is an frugal number, since it uses more digits than its factorization.
6914421409 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3422 (or 1704 counting only the distinct ones).
The product of its (nonzero) digits is 62208, while the sum is 40.
The cubic root of 6914421409 is about 1905.1036754657.
The spelling of 6914421409 in words is "six billion, nine hundred fourteen million, four hundred twenty-one thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •