Base | Representation |
---|---|
bin | 10000000010010100111… |
… | …011101101110111110101 |
3 | 10220100110222211002210121 |
4 | 100002110323231313311 |
5 | 121023404114411013 |
6 | 2202131225251541 |
7 | 142421562040015 |
oct | 20022473556765 |
9 | 3810428732717 |
10 | 1102010310133 |
11 | 3953a60aa827 |
12 | 1596b1033bb1 |
13 | 7cbc44223b5 |
14 | 3b4a2487c45 |
15 | 1d9ec1ed58d |
hex | 10094eeddf5 |
1102010310133 has 8 divisors (see below), whose sum is σ = 1123929192888. Its totient is φ = 1080133139904.
The previous prime is 1102010310101. The next prime is 1102010310197. The reversal of 1102010310133 is 3310130102011.
It can be written as a sum of positive squares in 4 ways, for example, as 350491232529 + 751519077604 = 592023^2 + 866902^2 .
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 1102010310133 - 25 = 1102010310101 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 (1102010310833) 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, 10374766 + ... + 10480447.
It is an arithmetic number, because the mean of its divisors is an integer number (140491149111).
Almost surely, 21102010310133 is an apocalyptic number.
It is an amenable number.
1102010310133 is a deficient number, since it is larger than the sum of its proper divisors (21918882755).
1102010310133 is an equidigital number, since it uses as much as digits as its factorization.
1102010310133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20856263.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 1102010310133 its reverse (3310130102011), we get a palindrome (4412140412144).
The spelling of 1102010310133 in words is "one trillion, one hundred two billion, ten million, three hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •