Base | Representation |
---|---|
bin | 10011110010110101100… |
… | …101000001101110110001 |
3 | 11211001001120201211212110 |
4 | 103302311211001232301 |
5 | 134241301022014144 |
6 | 2520520515515533 |
7 | 200163261431013 |
oct | 23626545015661 |
9 | 4731046654773 |
10 | 1360256048049 |
11 | 484977093a08 |
12 | 19b762bb8ba9 |
13 | 9b36b903b42 |
14 | 49ba00501b3 |
15 | 255b3da40b9 |
hex | 13cb5941bb1 |
1360256048049 has 16 divisors (see below), whose sum is σ = 1825761855104. Its totient is φ = 900794304000.
The previous prime is 1360256048023. The next prime is 1360256048051. The reversal of 1360256048049 is 9408406520631.
It is not a de Polignac number, because 1360256048049 - 27 = 1360256047921 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1360256047989 and 1360256048007.
It is not an unprimeable number, because it can be changed into a prime (1360256048059) 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, 14636769 + ... + 14729409.
It is an arithmetic number, because the mean of its divisors is an integer number (114110115944).
Almost surely, 21360256048049 is an apocalyptic number.
It is an amenable number.
1360256048049 is a deficient number, since it is larger than the sum of its proper divisors (465505807055).
1360256048049 is a wasteful number, since it uses less digits than its factorization.
1360256048049 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125208.
The product of its (nonzero) digits is 1244160, while the sum is 48.
The spelling of 1360256048049 in words is "one trillion, three hundred sixty billion, two hundred fifty-six million, forty-eight thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •