Base | Representation |
---|---|
bin | 10111011100010110010000… |
… | …110110011100101110001011 |
3 | 111112001120011201022022211010 |
4 | 113130112100312130232023 |
5 | 102003220142223224003 |
6 | 1003140530340335003 |
7 | 30500645301104454 |
oct | 2734262066345613 |
9 | 445046151268733 |
10 | 103103120133003 |
11 | 2a940873471071 |
12 | b6920aa3a4463 |
13 | 456b775a0c413 |
14 | 1b663092c412b |
15 | bdbe37122003 |
hex | 5dc590d9cb8b |
103103120133003 has 8 divisors (see below), whose sum is σ = 138474263536848. Its totient is φ = 68233695075584.
The previous prime is 103103120132993. The next prime is 103103120133017. The reversal of 103103120133003 is 300331021301301.
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 103103120133003 - 29 = 103103120132491 is a prime.
It is a super-3 number, since 3×1031031201330033 (a number of 43 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (103103120133043) 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, 125429586126 + ... + 125429586947.
It is an arithmetic number, because the mean of its divisors is an integer number (17309282942106).
Almost surely, 2103103120133003 is an apocalyptic number.
103103120133003 is a deficient number, since it is larger than the sum of its proper divisors (35371143403845).
103103120133003 is a wasteful number, since it uses less digits than its factorization.
103103120133003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 250859173213.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 103103120133003 its reverse (300331021301301), we get a palindrome (403434141434304).
The spelling of 103103120133003 in words is "one hundred three trillion, one hundred three billion, one hundred twenty million, one hundred thirty-three thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •