Base | Representation |
---|---|
bin | 10111011010110110011010… |
… | …111111101001100110110011 |
3 | 111111200201112210210220102021 |
4 | 113122312122333221212303 |
5 | 102000023413020232011 |
6 | 1003021351014532311 |
7 | 30460343151553420 |
oct | 2732663277514663 |
9 | 444621483726367 |
10 | 103000211102131 |
11 | 2a901164a59022 |
12 | b67616a367097 |
13 | 4561b55619545 |
14 | 1b61345b7ad47 |
15 | bd9412812471 |
hex | 5dad9afe99b3 |
103000211102131 has 8 divisors (see below), whose sum is σ = 117730038238560. Its totient is φ = 88274261781888.
The previous prime is 103000211102099. The next prime is 103000211102167. The reversal of 103000211102131 is 131201112000301.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103000211102131 - 25 = 103000211102099 is a prime.
It is a super-2 number, since 2×1030002111021312 (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 (103000211102231) 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, 969397126 + ... + 969503371.
It is an arithmetic number, because the mean of its divisors is an integer number (14716254779820).
Almost surely, 2103000211102131 is an apocalyptic number.
103000211102131 is a deficient number, since it is larger than the sum of its proper divisors (14729827136429).
103000211102131 is an equidigital number, since it uses as much as digits as its factorization.
103000211102131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1938908093.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 103000211102131 its reverse (131201112000301), we get a palindrome (234201323102432).
The spelling of 103000211102131 in words is "one hundred three trillion, two hundred eleven million, one hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •