Base | Representation |
---|---|
bin | 10000000010010101000… |
… | …110000110001110100101 |
3 | 10220100111011221100120210 |
4 | 100002111012012032211 |
5 | 121023410314000313 |
6 | 2202131403450033 |
7 | 142421624132364 |
oct | 20022506061645 |
9 | 3810434840523 |
10 | 1102013031333 |
11 | 3953a7699255 |
12 | 1596b1b26919 |
13 | 7cbc4b65b86 |
14 | 3b4a29957db |
15 | 1d9ec5899c3 |
hex | 100951863a5 |
1102013031333 has 8 divisors (see below), whose sum is σ = 1503521655328. Its totient is φ = 717589880784.
The previous prime is 1102013031313. The next prime is 1102013031349. The reversal of 1102013031333 is 3331303102011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1102013031333 - 225 = 1101979476901 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 (1102013031313) 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, 4271368210 + ... + 4271368467.
It is an arithmetic number, because the mean of its divisors is an integer number (187940206916).
Almost surely, 21102013031333 is an apocalyptic number.
It is an amenable number.
1102013031333 is a deficient number, since it is larger than the sum of its proper divisors (401508623995).
1102013031333 is an equidigital number, since it uses as much as digits as its factorization.
1102013031333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8542736723.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 1102013031333 its reverse (3331303102011), we get a palindrome (4433316133344).
The spelling of 1102013031333 in words is "one trillion, one hundred two billion, thirteen million, thirty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •