Base | Representation |
---|---|
bin | 10111001110001100111111… |
… | …111111110001010000001011 |
3 | 111101121122020000211212202222 |
4 | 113032030333333301100023 |
5 | 101341303443324404003 |
6 | 1001114214033244255 |
7 | 30340504614650156 |
oct | 2716147777612013 |
9 | 441548200755688 |
10 | 102131101013003 |
11 | 2a5a6613a73497 |
12 | b55583710368b |
13 | 44cabc96c890a |
14 | 1b31259090c9d |
15 | bc19e70e6c38 |
hex | 5ce33fff140b |
102131101013003 has 4 divisors (see below), whose sum is σ = 102131121480360. Its totient is φ = 102131080545648.
The previous prime is 102131101012957. The next prime is 102131101013063. The reversal of 102131101013003 is 300310101131201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 102131101013003 - 232 = 102126806045707 is a prime.
It is a super-3 number, since 3×1021311010130033 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102131101013063) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2699528 + ... + 14544746.
It is an arithmetic number, because the mean of its divisors is an integer number (25532780370090).
Almost surely, 2102131101013003 is an apocalyptic number.
102131101013003 is a deficient number, since it is larger than the sum of its proper divisors (20467357).
102131101013003 is an equidigital number, since it uses as much as digits as its factorization.
102131101013003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20467356.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 102131101013003 its reverse (300310101131201), we get a palindrome (402441202144204).
The spelling of 102131101013003 in words is "one hundred two trillion, one hundred thirty-one billion, one hundred one million, thirteen thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •