Base | Representation |
---|---|
bin | 10111011100010110001011… |
… | …011111111000001100010011 |
3 | 111112001112221110022212102211 |
4 | 113130112023133320030103 |
5 | 102003220001231031011 |
6 | 1003140513411452551 |
7 | 30500643130562506 |
oct | 2734261337701423 |
9 | 445045843285384 |
10 | 103103030330131 |
11 | 2a940827804917 |
12 | b6920842b7157 |
13 | 456b760229120 |
14 | 1b662db3c913d |
15 | bdbe2e2d3b21 |
hex | 5dc58b7f8313 |
103103030330131 has 8 divisors (see below), whose sum is σ = 111034112666400. Its totient is φ = 95171959422912.
The previous prime is 103103030330117. The next prime is 103103030330147. The reversal of 103103030330131 is 131033030301301.
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 103103030330131 - 213 = 103103030321939 is a prime.
It is a super-2 number, since 2×1031030303301312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103103030339131) 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, 29200506 + ... + 32540368.
It is an arithmetic number, because the mean of its divisors is an integer number (13879264083300).
Almost surely, 2103103030330131 is an apocalyptic number.
103103030330131 is a deficient number, since it is larger than the sum of its proper divisors (7931082336269).
103103030330131 is a wasteful number, since it uses less digits than its factorization.
103103030330131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5714525.
The product of its (nonzero) digits is 729, while the sum is 22.
Adding to 103103030330131 its reverse (131033030301301), we get a palindrome (234136060631432).
The spelling of 103103030330131 in words is "one hundred three trillion, one hundred three billion, thirty million, three hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •