Base | Representation |
---|---|
bin | 1011111010001110011110… |
… | …0100101001110001010001 |
3 | 1201100212100021010210210002 |
4 | 2332203213210221301101 |
5 | 3204021422014312002 |
6 | 43503422423215345 |
7 | 2521035645621461 |
oct | 276434744516121 |
9 | 51325307123702 |
10 | 13094945463377 |
11 | 41995983696a8 |
12 | 1575a7a8a7555 |
13 | 73cb04252c8b |
14 | 333b27a69ba1 |
15 | 17a969c96002 |
hex | be8e7929c51 |
13094945463377 has 4 divisors (see below), whose sum is σ = 13157006816496. Its totient is φ = 13032884110260.
The previous prime is 13094945463359. The next prime is 13094945463401. The reversal of 13094945463377 is 77336454949031.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13094945463377 - 210 = 13094945462353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13094945463317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 31030676243 + ... + 31030676664.
It is an arithmetic number, because the mean of its divisors is an integer number (3289251704124).
Almost surely, 213094945463377 is an apocalyptic number.
It is an amenable number.
13094945463377 is a deficient number, since it is larger than the sum of its proper divisors (62061353119).
13094945463377 is an equidigital number, since it uses as much as digits as its factorization.
13094945463377 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62061353118.
The product of its (nonzero) digits is 205752960, while the sum is 65.
The spelling of 13094945463377 in words is "thirteen trillion, ninety-four billion, nine hundred forty-five million, four hundred sixty-three thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •