Base | Representation |
---|---|
bin | 1101011010000010011100… |
… | …1100011000010001110000 |
3 | 1221012020001121112011002022 |
4 | 3112200213030120101300 |
5 | 3413004014220111324 |
6 | 51203525402011012 |
7 | 3051000233541461 |
oct | 326404714302160 |
9 | 57166047464068 |
10 | 14740985316464 |
11 | 4773686a07150 |
12 | 17a0a9a1a6a68 |
13 | 82c0b863c024 |
14 | 38d678b48d68 |
15 | 1a86a821d05e |
hex | d6827318470 |
14740985316464 has 80 divisors (see below), whose sum is σ = 31319909397504. Its totient is φ = 6665475763200.
The previous prime is 14740985316443. The next prime is 14740985316467. The reversal of 14740985316464 is 46461358904741.
It is a junction number, because it is equal to n+sod(n) for n = 14740985316397 and 14740985316406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14740985316467) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 53278547 + ... + 53554509.
Almost surely, 214740985316464 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14740985316464, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15659954698752).
14740985316464 is an abundant number, since it is smaller than the sum of its proper divisors (16578924081040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14740985316464 is a wasteful number, since it uses less digits than its factorization.
14740985316464 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 277566 (or 277560 counting only the distinct ones).
The product of its (nonzero) digits is 69672960, while the sum is 62.
The spelling of 14740985316464 in words is "fourteen trillion, seven hundred forty billion, nine hundred eighty-five million, three hundred sixteen thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •