Base | Representation |
---|---|
bin | 11101110010011100111101… |
… | …000010001011111000001011 |
3 | 122011212110202211100021220212 |
4 | 131302130331002023320023 |
5 | 114132433310310204003 |
6 | 1142345204021111335 |
7 | 36411122061050333 |
oct | 3562347502137013 |
9 | 564773684307825 |
10 | 131010411413003 |
11 | 38820226898881 |
12 | 1283a84185854b |
13 | 58142c8847525 |
14 | 244cd1b2600c3 |
15 | 1022d34d87dd8 |
hex | 77273d08be0b |
131010411413003 has 8 divisors (see below), whose sum is σ = 131171636382720. Its totient is φ = 130849244962920.
The previous prime is 131010411412999. The next prime is 131010411413023. The reversal of 131010411413003 is 300314114010131.
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 131010411413003 - 22 = 131010411412999 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 131010411413003.
It is not an unprimeable number, because it can be changed into a prime (131010411413023) 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, 10148825 + ... + 19105482.
It is an arithmetic number, because the mean of its divisors is an integer number (16396454547840).
Almost surely, 2131010411413003 is an apocalyptic number.
131010411413003 is a deficient number, since it is larger than the sum of its proper divisors (161224969717).
131010411413003 is an equidigital number, since it uses as much as digits as its factorization.
131010411413003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29259817.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 131010411413003 its reverse (300314114010131), we get a palindrome (431324525423134).
The spelling of 131010411413003 in words is "one hundred thirty-one trillion, ten billion, four hundred eleven million, four hundred thirteen thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •