Base | Representation |
---|---|
bin | 11101011111010001011… |
… | …11101110110110010001 |
3 | 10120212022012012210120011 |
4 | 32233220233232312101 |
5 | 113100034332010304 |
6 | 2053245014514521 |
7 | 133126406046016 |
oct | 16575057566621 |
9 | 3525265183504 |
10 | 1013222141329 |
11 | 360783536422 |
12 | 144452065a41 |
13 | 747146a77c8 |
14 | 3707c4b970d |
15 | 1b552447c04 |
hex | ebe8beed91 |
1013222141329 has 8 divisors (see below), whose sum is σ = 1033362726120. Its totient is φ = 993119452416.
The previous prime is 1013222141263. The next prime is 1013222141377. The reversal of 1013222141329 is 9231412223101.
It can be written as a sum of positive squares in 4 ways, for example, as 181943196304 + 831278945025 = 426548^2 + 911745^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1013222141329 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1013222141329.
It is not an unprimeable number, because it can be changed into a prime (1013222144329) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9419962 + ... + 9526915.
It is an arithmetic number, because the mean of its divisors is an integer number (129170340765).
Almost surely, 21013222141329 is an apocalyptic number.
It is an amenable number.
1013222141329 is a deficient number, since it is larger than the sum of its proper divisors (20140584791).
1013222141329 is a wasteful number, since it uses less digits than its factorization.
1013222141329 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18947939.
The product of its (nonzero) digits is 5184, while the sum is 31.
The spelling of 1013222141329 in words is "one trillion, thirteen billion, two hundred twenty-two million, one hundred forty-one thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •