Base | Representation |
---|---|
bin | 10111011100010100100110… |
… | …001110100110001010010101 |
3 | 111112001101120001022020122110 |
4 | 113130110212032212022111 |
5 | 102003203011303113023 |
6 | 1003140033035421233 |
7 | 30500553050223033 |
oct | 2734244616461225 |
9 | 445041501266573 |
10 | 103101331301013 |
11 | 2a940035745121 |
12 | b69188b2b4819 |
13 | 456b54c22c756 |
14 | 1b661b98b7553 |
15 | bdbd80072a93 |
hex | 5dc5263a6295 |
103101331301013 has 48 divisors (see below), whose sum is σ = 140341844005440. Its totient is φ = 67308724224000.
The previous prime is 103101331300997. The next prime is 103101331301041. The reversal of 103101331301013 is 310103133101301.
It is not a de Polignac number, because 103101331301013 - 24 = 103101331300997 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103101331300013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 15982221438 + ... + 15982227888.
It is an arithmetic number, because the mean of its divisors is an integer number (2923788416780).
Almost surely, 2103101331301013 is an apocalyptic number.
It is an amenable number.
103101331301013 is a deficient number, since it is larger than the sum of its proper divisors (37240512704427).
103101331301013 is an frugal number, since it uses more digits than its factorization.
103101331301013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7958 (or 7621 counting only the distinct ones).
The product of its (nonzero) digits is 243, while the sum is 21.
Adding to 103101331301013 its reverse (310103133101301), we get a palindrome (413204464402314).
The spelling of 103101331301013 in words is "one hundred three trillion, one hundred one billion, three hundred thirty-one million, three hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •