Base | Representation |
---|---|
bin | 10011110011001000010… |
… | …010101100110110100010 |
3 | 11211001212110111211010110 |
4 | 103303020102230312202 |
5 | 134242421410323132 |
6 | 2521012013112150 |
7 | 200204123164014 |
oct | 23631022546642 |
9 | 4731773454113 |
10 | 1360570011042 |
11 | 485018334a60 |
12 | 19b830188656 |
13 | 9b3bb980268 |
14 | 49bcda1a1b4 |
15 | 255d17201cc |
hex | 13cc84acda2 |
1360570011042 has 64 divisors (see below), whose sum is σ = 3010835847168. Its totient is φ = 406418208000.
The previous prime is 1360570011041. The next prime is 1360570011077. The reversal of 1360570011042 is 2401100750631.
It is not an unprimeable number, because it can be changed into a prime (1360570011041) 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 31 ways as a sum of consecutive naturals, for example, 32176378 + ... + 32218634.
It is an arithmetic number, because the mean of its divisors is an integer number (47044310112).
Almost surely, 21360570011042 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1360570011042, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1505417923584).
1360570011042 is an abundant number, since it is smaller than the sum of its proper divisors (1650265836126).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1360570011042 is a wasteful number, since it uses less digits than its factorization.
1360570011042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49215.
The product of its (nonzero) digits is 5040, while the sum is 30.
Adding to 1360570011042 its reverse (2401100750631), we get a palindrome (3761670761673).
The spelling of 1360570011042 in words is "one trillion, three hundred sixty billion, five hundred seventy million, eleven thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •