Base | Representation |
---|---|
bin | 1100011101110011111000… |
… | …1011111010010100000001 |
3 | 1210112022022111100201201201 |
4 | 3013130332023322110001 |
5 | 3244030432142420421 |
6 | 45052325132501201 |
7 | 2613150331212001 |
oct | 307347613722401 |
9 | 53468274321651 |
10 | 13706283951361 |
11 | 4404890a72021 |
12 | 165445291a801 |
13 | 78565cc90171 |
14 | 35555db32001 |
15 | 18b7ea265b91 |
hex | c773e2fa501 |
13706283951361 has 8 divisors (see below), whose sum is σ = 13714593754400. Its totient is φ = 13697976445920.
The previous prime is 13706283951337. The next prime is 13706283951389. The reversal of 13706283951361 is 16315938260731.
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 13706283951361 - 223 = 13706275562753 is a prime.
It is a super-2 number, since 2×137062839513612 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13706283951331) 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 7 ways as a sum of consecutive naturals, for example, 11436166 + ... + 12577696.
It is an arithmetic number, because the mean of its divisors is an integer number (1714324219300).
Almost surely, 213706283951361 is an apocalyptic number.
It is an amenable number.
13706283951361 is a deficient number, since it is larger than the sum of its proper divisors (8309803039).
13706283951361 is a wasteful number, since it uses less digits than its factorization.
13706283951361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1148799.
The product of its (nonzero) digits is 4898880, while the sum is 55.
The spelling of 13706283951361 in words is "thirteen trillion, seven hundred six billion, two hundred eighty-three million, nine hundred fifty-one thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •