Base | Representation |
---|---|
bin | 1101011011111101101101… |
… | …0100010110001011110000 |
3 | 1221022101110111002122010100 |
4 | 3112333123110112023300 |
5 | 3414024244422344432 |
6 | 51231040502032400 |
7 | 3053251164415356 |
oct | 326773324261360 |
9 | 57271414078110 |
10 | 14774072074992 |
11 | 478671558858a |
12 | 17a7392a18700 |
13 | 83225c374059 |
14 | 3910d71017d6 |
15 | 1a9492d2707c |
hex | d6fdb5162f0 |
14774072074992 has 30 divisors (see below), whose sum is σ = 41346882265832. Its totient is φ = 4924690691616.
The previous prime is 14774072074967. The next prime is 14774072074999. The reversal of 14774072074992 is 29947027047741.
14774072074992 is a `hidden beast` number, since 1 + 4 + 7 + 74 + 0 + 72 + 0 + 7 + 499 + 2 = 666.
It is a Smith number, since the sum of its digits (63) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14774072074999) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 51298861228 + ... + 51298861515.
Almost surely, 214774072074992 is an apocalyptic number.
14774072074992 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14774072074992 is an abundant number, since it is smaller than the sum of its proper divisors (26572810190840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14774072074992 is a wasteful number, since it uses less digits than its factorization.
14774072074992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102597722757 (or 102597722748 counting only the distinct ones).
The product of its (nonzero) digits is 49787136, while the sum is 63.
The spelling of 14774072074992 in words is "fourteen trillion, seven hundred seventy-four billion, seventy-two million, seventy-four thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •