Base | Representation |
---|---|
bin | 10000000010010101000… |
… | …110000011110010000001 |
3 | 10220100111011220211211200 |
4 | 100002111012003302001 |
5 | 121023410313140223 |
6 | 2202131403331413 |
7 | 142421624061231 |
oct | 20022506036201 |
9 | 3810434824750 |
10 | 1102013021313 |
11 | 3953a7691776 |
12 | 1596b1b20b69 |
13 | 7cbc4b61449 |
14 | 3b4a2991cc1 |
15 | 1d9ec586a43 |
hex | 10095183c81 |
1102013021313 has 24 divisors (see below), whose sum is σ = 1607664676800. Its totient is φ = 727352589600.
The previous prime is 1102013021303. The next prime is 1102013021323. The reversal of 1102013021313 is 3131203102011.
It is an interprime number because it is at equal distance from previous prime (1102013021303) and next prime (1102013021323).
It is not a de Polignac number, because 1102013021313 - 24 = 1102013021297 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1102013021303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 17875620 + ... + 17937162.
It is an arithmetic number, because the mean of its divisors is an integer number (66986028200).
Almost surely, 21102013021313 is an apocalyptic number.
It is an amenable number.
1102013021313 is a deficient number, since it is larger than the sum of its proper divisors (505651655487).
1102013021313 is a wasteful number, since it uses less digits than its factorization.
1102013021313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81349 (or 81346 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 1102013021313 its reverse (3131203102011), we get a palindrome (4233216123324).
The spelling of 1102013021313 in words is "one trillion, one hundred two billion, thirteen million, twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •