Base | Representation |
---|---|
bin | 101111100000110100… |
… | …1011011100100001111 |
3 | 100202100212022002122122 |
4 | 1133001221123210033 |
5 | 3132430434030221 |
6 | 114512351403155 |
7 | 10241322064505 |
oct | 1370151334417 |
9 | 322325262578 |
10 | 102033111311 |
11 | 3a2aa03878a |
12 | 179368234bb |
13 | 9810aaaca1 |
14 | 4d1d098675 |
15 | 29c298ceab |
hex | 17c1a5b90f |
102033111311 has 8 divisors (see below), whose sum is σ = 104727092400. Its totient is φ = 99348909760.
The previous prime is 102033111283. The next prime is 102033111431. The reversal of 102033111311 is 113111330201.
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 102033111311 - 26 = 102033111247 is a prime.
It is a super-2 number, since 2×1020331113112 (a number of 23 digits) contains 22 as substring.
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 102033111311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102033111211) 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, 2423741 + ... + 2465478.
It is an arithmetic number, because the mean of its divisors is an integer number (13090886550).
Almost surely, 2102033111311 is an apocalyptic number.
102033111311 is a deficient number, since it is larger than the sum of its proper divisors (2693981089).
102033111311 is an equidigital number, since it uses as much as digits as its factorization.
102033111311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4889769.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 102033111311 its reverse (113111330201), we get a palindrome (215144441512).
The spelling of 102033111311 in words is "one hundred two billion, thirty-three million, one hundred eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •