Base | Representation |
---|---|
bin | 10100100000000010101… |
… | …010111110101001110101 |
3 | 11222200100021122001211100 |
4 | 110200002222332221311 |
5 | 141040202242003242 |
6 | 2555105134400313 |
7 | 203532142135440 |
oct | 24400252765165 |
9 | 4880307561740 |
10 | 1408794094197 |
11 | 4a35145a2436 |
12 | 1a904a360099 |
13 | a2b058129c9 |
14 | 4c286542657 |
15 | 269a521754c |
hex | 14802abea75 |
1408794094197 has 24 divisors (see below), whose sum is σ = 2426742624384. Its totient is φ = 770024100384.
The previous prime is 1408794094171. The next prime is 1408794094219. The reversal of 1408794094197 is 7914904978041.
1408794094197 is a `hidden beast` number, since 140 + 8 + 79 + 4 + 0 + 9 + 419 + 7 = 666.
It is not a de Polignac number, because 1408794094197 - 211 = 1408794092149 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1408794094597) 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 23 ways as a sum of consecutive naturals, for example, 486124878 + ... + 486127775.
It is an arithmetic number, because the mean of its divisors is an integer number (101114276016).
Almost surely, 21408794094197 is an apocalyptic number.
It is an amenable number.
1408794094197 is a deficient number, since it is larger than the sum of its proper divisors (1017948530187).
1408794094197 is a wasteful number, since it uses less digits than its factorization.
1408794094197 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 972252689 (or 972252686 counting only the distinct ones).
The product of its (nonzero) digits is 18289152, while the sum is 63.
The spelling of 1408794094197 in words is "one trillion, four hundred eight billion, seven hundred ninety-four million, ninety-four thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •