Base | Representation |
---|---|
bin | 11000111111011010… |
… | …00100100100101001 |
3 | 1021122001002121101021 |
4 | 30133231010210221 |
5 | 204434200421133 |
6 | 10055200452441 |
7 | 653324003311 |
oct | 143755044451 |
9 | 37561077337 |
10 | 13416810793 |
11 | 5765492591 |
12 | 272531a121 |
13 | 135a84abc9 |
14 | 913c68441 |
15 | 537d3652d |
hex | 31fb44929 |
13416810793 has 8 divisors (see below), whose sum is σ = 13521901536. Its totient is φ = 13311760800.
The previous prime is 13416810749. The next prime is 13416810877. The reversal of 13416810793 is 39701861431.
13416810793 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 13416810793 - 229 = 12879939881 is a prime.
It is a super-2 number, since 2×134168107932 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13416810293) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1295805 + ... + 1306117.
It is an arithmetic number, because the mean of its divisors is an integer number (1690237692).
Almost surely, 213416810793 is an apocalyptic number.
It is an amenable number.
13416810793 is a deficient number, since it is larger than the sum of its proper divisors (105090743).
13416810793 is a wasteful number, since it uses less digits than its factorization.
13416810793 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20375.
The product of its (nonzero) digits is 108864, while the sum is 43.
The spelling of 13416810793 in words is "thirteen billion, four hundred sixteen million, eight hundred ten thousand, seven hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •