Base | Representation |
---|---|
bin | 11110110111001011000… |
… | …00000001100101000001 |
3 | 10202101002221212212212220 |
4 | 33123211200001211001 |
5 | 114333211024113403 |
6 | 2131051404241253 |
7 | 136420002050613 |
oct | 17334540014501 |
9 | 3671087785786 |
10 | 1060412332353 |
11 | 37979a1313a0 |
12 | 151621b40229 |
13 | 78cc529466a |
14 | 39477990db3 |
15 | 1c8b52b6953 |
hex | f6e5801941 |
1060412332353 has 32 divisors (see below), whose sum is σ = 1633558709760. Its totient is φ = 605113856640.
The previous prime is 1060412332349. The next prime is 1060412332381. The reversal of 1060412332353 is 3532332140601.
It is not a de Polignac number, because 1060412332353 - 22 = 1060412332349 is a prime.
It is a super-2 number, since 2×10604123323532 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (1060412330353) 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 31 ways as a sum of consecutive naturals, for example, 5085676 + ... + 5290077.
It is an arithmetic number, because the mean of its divisors is an integer number (51048709680).
Almost surely, 21060412332353 is an apocalyptic number.
It is an amenable number.
1060412332353 is a deficient number, since it is larger than the sum of its proper divisors (573146377407).
1060412332353 is a wasteful number, since it uses less digits than its factorization.
1060412332353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10375949.
The product of its (nonzero) digits is 38880, while the sum is 33.
Adding to 1060412332353 its reverse (3532332140601), we get a palindrome (4592744472954).
The spelling of 1060412332353 in words is "one trillion, sixty billion, four hundred twelve million, three hundred thirty-two thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •