Base | Representation |
---|---|
bin | 11101110010110001000110… |
… | …011000010000111101010011 |
3 | 122011221112121101001102012202 |
4 | 131302301012120100331103 |
5 | 114133312111004014103 |
6 | 1142403142313513415 |
7 | 36412516114556162 |
oct | 3562610630207523 |
9 | 564845541042182 |
10 | 131032043032403 |
11 | 38829417325687 |
12 | 12842a7a11286b |
13 | 5816365279016 |
14 | 244ddb010b3d9 |
15 | 102369de9b988 |
hex | 772c46610f53 |
131032043032403 has 8 divisors (see below), whose sum is σ = 131590215306240. Its totient is φ = 130473953434440.
The previous prime is 131032043032393. The next prime is 131032043032409. The reversal of 131032043032403 is 304230340230131.
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 131032043032403 - 26 = 131032043032339 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131032043032409) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17491403 + ... + 23833028.
It is an arithmetic number, because the mean of its divisors is an integer number (16448776913280).
Almost surely, 2131032043032403 is an apocalyptic number.
131032043032403 is a deficient number, since it is larger than the sum of its proper divisors (558172273837).
131032043032403 is a wasteful number, since it uses less digits than its factorization.
131032043032403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41337937.
The product of its (nonzero) digits is 15552, while the sum is 29.
Adding to 131032043032403 its reverse (304230340230131), we get a palindrome (435262383262534).
The spelling of 131032043032403 in words is "one hundred thirty-one trillion, thirty-two billion, forty-three million, thirty-two thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •