Base | Representation |
---|---|
bin | 101111100011001011… |
… | …0110011001010100001 |
3 | 100202120100221211000201 |
4 | 1133012112303022201 |
5 | 3133111200111223 |
6 | 114524252545201 |
7 | 10243301433160 |
oct | 1370626631241 |
9 | 322510854021 |
10 | 102112113313 |
11 | 3a33a6980a1 |
12 | 17959182201 |
13 | 982427c032 |
14 | 4d297813d7 |
15 | 29c9895ead |
hex | 17c65b32a1 |
102112113313 has 8 divisors (see below), whose sum is σ = 116766372032. Its totient is φ = 87474558096.
The previous prime is 102112113263. The next prime is 102112113343. The reversal of 102112113313 is 313311211201.
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 102112113313 - 29 = 102112112801 is a prime.
It is a super-3 number, since 3×1021121133133 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102112113343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4162770 + ... + 4187227.
It is an arithmetic number, because the mean of its divisors is an integer number (14595796504).
Almost surely, 2102112113313 is an apocalyptic number.
It is an amenable number.
102112113313 is a deficient number, since it is larger than the sum of its proper divisors (14654258719).
102112113313 is an equidigital number, since it uses as much as digits as its factorization.
102112113313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8351751.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 102112113313 its reverse (313311211201), we get a palindrome (415423324514).
The spelling of 102112113313 in words is "one hundred two billion, one hundred twelve million, one hundred thirteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •