Base | Representation |
---|---|
bin | 10000000000110000010… |
… | …100011110100101101001 |
3 | 10220012010100112102101110 |
4 | 100000300110132211221 |
5 | 121011430002133223 |
6 | 2201251525340533 |
7 | 142332004152303 |
oct | 20006024364551 |
9 | 3805110472343 |
10 | 1100322302313 |
11 | 39470a288543 |
12 | 1592bb867749 |
13 | 7c9b57b43c0 |
14 | 3b382204973 |
15 | 1d94de17d93 |
hex | 1003051e969 |
1100322302313 has 16 divisors (see below), whose sum is σ = 1579974139520. Its totient is φ = 677111059584.
The previous prime is 1100322302309. The next prime is 1100322302329. The reversal of 1100322302313 is 3132032230011.
It is not a de Polignac number, because 1100322302313 - 22 = 1100322302309 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 1100322302313.
It is not an unprimeable number, because it can be changed into a prime (1100322302363) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2957220 + ... + 3308442.
It is an arithmetic number, because the mean of its divisors is an integer number (98748383720).
Almost surely, 21100322302313 is an apocalyptic number.
1100322302313 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1100322302313 is a deficient number, since it is larger than the sum of its proper divisors (479651837207).
1100322302313 is a wasteful number, since it uses less digits than its factorization.
1100322302313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 431568.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 1100322302313 its reverse (3132032230011), we get a palindrome (4232354532324).
The spelling of 1100322302313 in words is "one trillion, one hundred billion, three hundred twenty-two million, three hundred two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •