Base | Representation |
---|---|
bin | 10101001111111110000… |
… | …011000010000011010001 |
3 | 12011121011202111220020120 |
4 | 111033332003002003101 |
5 | 142411101031333131 |
6 | 3034455444300453 |
7 | 210333336142224 |
oct | 25177603020321 |
9 | 5147152456216 |
10 | 1460256121041 |
11 | 513322569933 |
12 | 1b70109a1729 |
13 | a791743a873 |
14 | 509690cd5bb |
15 | 27eb8105496 |
hex | 153fe0c20d1 |
1460256121041 has 16 divisors (see below), whose sum is σ = 2033287440000. Its totient is φ = 930432222720.
The previous prime is 1460256121031. The next prime is 1460256121057. The reversal of 1460256121041 is 1401216520641.
It is not a de Polignac number, because 1460256121041 - 213 = 1460256112849 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1460256120993 and 1460256121011.
It is not an unprimeable number, because it can be changed into a prime (1460256121021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8385850 + ... + 8558211.
It is an arithmetic number, because the mean of its divisors is an integer number (127080465000).
Almost surely, 21460256121041 is an apocalyptic number.
It is an amenable number.
1460256121041 is a deficient number, since it is larger than the sum of its proper divisors (573031318959).
1460256121041 is a wasteful number, since it uses less digits than its factorization.
1460256121041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16945336.
The product of its (nonzero) digits is 11520, while the sum is 33.
The spelling of 1460256121041 in words is "one trillion, four hundred sixty billion, two hundred fifty-six million, one hundred twenty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •