Base | Representation |
---|---|
bin | 10011101110111011100… |
… | …111010100001110101000 |
3 | 11210122020022112121120010 |
4 | 103232323213110032220 |
5 | 134204203430002404 |
6 | 2514544430131520 |
7 | 166654326511626 |
oct | 23567347241650 |
9 | 4718208477503 |
10 | 1356062344104 |
11 | 483114928086 |
12 | 19a992650ba0 |
13 | 9ab50b20b10 |
14 | 498c30b6516 |
15 | 2541ab1a189 |
hex | 13bbb9d43a8 |
1356062344104 has 128 divisors (see below), whose sum is σ = 3771681177600. Its totient is φ = 403471860480.
The previous prime is 1356062344097. The next prime is 1356062344139. The reversal of 1356062344104 is 4014432606531.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 12354537 + ... + 12463815.
It is an arithmetic number, because the mean of its divisors is an integer number (29466259200).
Almost surely, 21356062344104 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1356062344104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1885840588800).
1356062344104 is an abundant number, since it is smaller than the sum of its proper divisors (2415618833496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1356062344104 is a wasteful number, since it uses less digits than its factorization.
1356062344104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110615 (or 110611 counting only the distinct ones).
The product of its (nonzero) digits is 207360, while the sum is 39.
The spelling of 1356062344104 in words is "one trillion, three hundred fifty-six billion, sixty-two million, three hundred forty-four thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •