Base | Representation |
---|---|
bin | 10111011100011101101000… |
… | …011111101100001110001010 |
3 | 111112002022121011210021201110 |
4 | 113130131220133230032022 |
5 | 102003332343422410010 |
6 | 1003144315445031150 |
7 | 30501345343346022 |
oct | 2734355037541612 |
9 | 445068534707643 |
10 | 103111033013130 |
11 | 2a94416404501a |
12 | b6937383b54b6 |
13 | 456c43719b4cc |
14 | 1b6685a190a82 |
15 | bdc24bb5e120 |
hex | 5dc7687ec38a |
103111033013130 has 16 divisors (see below), whose sum is σ = 247466479231584. Its totient is φ = 27496275470160.
The previous prime is 103111033013101. The next prime is 103111033013137. The reversal of 103111033013130 is 31310330111301.
It is a junction number, because it is equal to n+sod(n) for n = 103111033013097 and 103111033013106.
It is not an unprimeable number, because it can be changed into a prime (103111033013137) 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, 1718517216856 + ... + 1718517216915.
It is an arithmetic number, because the mean of its divisors is an integer number (15466654951974).
Almost surely, 2103111033013130 is an apocalyptic number.
103111033013130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103111033013130 is an abundant number, since it is smaller than the sum of its proper divisors (144355446218454).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103111033013130 is a wasteful number, since it uses less digits than its factorization.
103111033013130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3437034433781.
The product of its (nonzero) digits is 243, while the sum is 21.
Adding to 103111033013130 its reverse (31310330111301), we get a palindrome (134421363124431).
The spelling of 103111033013130 in words is "one hundred three trillion, one hundred eleven billion, thirty-three million, thirteen thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •