Base | Representation |
---|---|
bin | 10000000000011101010… |
… | …010111001101101011101 |
3 | 10220011022002221101022212 |
4 | 100000131102321231131 |
5 | 121010301244401023 |
6 | 2201200124250205 |
7 | 142321050156425 |
oct | 20003522715535 |
9 | 3804262841285 |
10 | 1100003122013 |
11 | 3945660a3674 |
12 | 1592309a0965 |
13 | 7c96462c313 |
14 | 3b351a7b485 |
15 | 1d930dbae78 |
hex | 1001d4b9b5d |
1100003122013 has 4 divisors (see below), whose sum is σ = 1100005316640. Its totient is φ = 1100000927388.
The previous prime is 1100003121989. The next prime is 1100003122079. The reversal of 1100003122013 is 3102213000011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1100003122013 - 218 = 1100002859869 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 (1100003122213) 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 3 ways as a sum of consecutive naturals, for example, 64706 + ... + 1484652.
It is an arithmetic number, because the mean of its divisors is an integer number (275001329160).
Almost surely, 21100003122013 is an apocalyptic number.
It is an amenable number.
1100003122013 is a deficient number, since it is larger than the sum of its proper divisors (2194627).
1100003122013 is an equidigital number, since it uses as much as digits as its factorization.
1100003122013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2194626.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 1100003122013 its reverse (3102213000011), we get a palindrome (4202216122024).
The spelling of 1100003122013 in words is "one trillion, one hundred billion, three million, one hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.335 sec. • engine limits •