Base | Representation |
---|---|
bin | 10100011101111000111… |
… | …010011100111000100001 |
3 | 11222110101012200221200201 |
4 | 110131320322130320201 |
5 | 141020434110104434 |
6 | 2554043533345201 |
7 | 203420646226510 |
oct | 24357072347041 |
9 | 4873335627621 |
10 | 1406482894369 |
11 | 4a2538a21833 |
12 | 1a8704338201 |
13 | a2827a48b47 |
14 | 4c1075da677 |
15 | 268bc382614 |
hex | 14778e9ce21 |
1406482894369 has 8 divisors (see below), whose sum is σ = 1633759990208. Its totient is φ = 1185793540560.
The previous prime is 1406482894343. The next prime is 1406482894381. The reversal of 1406482894369 is 9634982846041.
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 1406482894369 - 221 = 1406480797217 is a prime.
It is a super-2 number, since 2×14064828943692 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1406482894369.
It is not an unprimeable number, because it can be changed into a prime (1406482894309) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1646935047 + ... + 1646935900.
It is an arithmetic number, because the mean of its divisors is an integer number (204219998776).
Almost surely, 21406482894369 is an apocalyptic number.
It is an amenable number.
1406482894369 is a deficient number, since it is larger than the sum of its proper divisors (227277095839).
1406482894369 is an equidigital number, since it uses as much as digits as its factorization.
1406482894369 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3293871015.
The product of its (nonzero) digits is 71663616, while the sum is 64.
The spelling of 1406482894369 in words is "one trillion, four hundred six billion, four hundred eighty-two million, eight hundred ninety-four thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •