Base | Representation |
---|---|
bin | 111101000110001100… |
… | …0110011111001000011 |
3 | 110112122212002201002022 |
4 | 1322030120303321003 |
5 | 4122201302124443 |
6 | 140135140112055 |
7 | 12323236300433 |
oct | 1721430637103 |
9 | 415585081068 |
10 | 131204333123 |
11 | 50709475466 |
12 | 2151809562b |
13 | c4ac555396 |
14 | 64c94062c3 |
15 | 362d957e68 |
hex | 1e8c633e43 |
131204333123 has 8 divisors (see below), whose sum is σ = 141321681600. Its totient is φ = 121408170408.
The previous prime is 131204333107. The next prime is 131204333137. The reversal of 131204333123 is 321333402131.
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 131204333123 - 24 = 131204333107 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131204333092 and 131204333101.
It is not an unprimeable number, because it can be changed into a prime (131204333723) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 80295593 + ... + 80297226.
It is an arithmetic number, because the mean of its divisors is an integer number (17665210200).
Almost surely, 2131204333123 is an apocalyptic number.
131204333123 is a deficient number, since it is larger than the sum of its proper divisors (10117348477).
131204333123 is a wasteful number, since it uses less digits than its factorization.
131204333123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 160592881.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 131204333123 its reverse (321333402131), we get a palindrome (452537735254).
The spelling of 131204333123 in words is "one hundred thirty-one billion, two hundred four million, three hundred thirty-three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •