Base | Representation |
---|---|
bin | 11101111000001010100101… |
… | …101111011001100101000011 |
3 | 122020021000010201002000121201 |
4 | 131320022211233121211003 |
5 | 114210401331042320003 |
6 | 1143245413130002031 |
7 | 36451361042023546 |
oct | 3570124557314503 |
9 | 566230121060551 |
10 | 131403010120003 |
11 | 389617815a81a6 |
12 | 128a294a276317 |
13 | 58423349a794b |
14 | 2463d2248685d |
15 | 102d161aeab1d |
hex | 7782a5bd9943 |
131403010120003 has 4 divisors (see below), whose sum is σ = 131418912707248. Its totient is φ = 131387107532760.
The previous prime is 131403010119967. The next prime is 131403010120069. The reversal of 131403010120003 is 300021010304131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131403010120003 is a prime.
It is a super-2 number, since 2×1314030101200032 (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 (131403010121003) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7951281228 + ... + 7951297753.
It is an arithmetic number, because the mean of its divisors is an integer number (32854728176812).
Almost surely, 2131403010120003 is an apocalyptic number.
131403010120003 is a deficient number, since it is larger than the sum of its proper divisors (15902587245).
131403010120003 is an equidigital number, since it uses as much as digits as its factorization.
131403010120003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15902587244.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 131403010120003 its reverse (300021010304131), we get a palindrome (431424020424134).
The spelling of 131403010120003 in words is "one hundred thirty-one trillion, four hundred three billion, ten million, one hundred twenty thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •