Base | Representation |
---|---|
bin | 10000000001110000101… |
… | …111001001001100101101 |
3 | 10220021220200010022010021 |
4 | 100001300233021030231 |
5 | 121021133134100123 |
6 | 2201551053242141 |
7 | 142400536215613 |
oct | 20016057111455 |
9 | 3807820108107 |
10 | 1101403034413 |
11 | 395114332570 |
12 | 159561793351 |
13 | 7cb28679c56 |
14 | 3b4459696b3 |
15 | 1d9b3c44c5d |
hex | 10070bc932d |
1101403034413 has 8 divisors (see below), whose sum is σ = 1272208852800. Its totient is φ = 942376927680.
The previous prime is 1101403034411. The next prime is 1101403034441. The reversal of 1101403034413 is 3144303041011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1101403034413 - 21 = 1101403034411 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101403034411) 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 7 ways as a sum of consecutive naturals, for example, 2944927713 + ... + 2944928086.
It is an arithmetic number, because the mean of its divisors is an integer number (159026106600).
Almost surely, 21101403034413 is an apocalyptic number.
It is an amenable number.
1101403034413 is a deficient number, since it is larger than the sum of its proper divisors (170805818387).
1101403034413 is a wasteful number, since it uses less digits than its factorization.
1101403034413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5889855827.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 1101403034413 its reverse (3144303041011), we get a palindrome (4245706075424).
The spelling of 1101403034413 in words is "one trillion, one hundred one billion, four hundred three million, thirty-four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •