Base | Representation |
---|---|
bin | 11101110010010011100011… |
… | …100011110000100100100111 |
3 | 122011211111201120012011102210 |
4 | 131302103203203300210213 |
5 | 114132302124001030043 |
6 | 1142340414422134503 |
7 | 36410314026212334 |
oct | 3562234343604447 |
9 | 564744646164383 |
10 | 131000320330023 |
11 | 38816a18722881 |
12 | 128388a6281433 |
13 | 581337b019201 |
14 | 244c640d8b98b |
15 | 1022943ed7633 |
hex | 7724e38f0927 |
131000320330023 has 8 divisors (see below), whose sum is σ = 175288684855536. Its totient is φ = 87022751345600.
The previous prime is 131000320330003. The next prime is 131000320330031. The reversal of 131000320330023 is 320033023000131.
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 131000320330023 - 216 = 131000320264487 is a prime.
It is a super-2 number, since 2×1310003203300232 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131000320330003) 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, 77698884288 + ... + 77698885973.
It is an arithmetic number, because the mean of its divisors is an integer number (21911085606942).
Almost surely, 2131000320330023 is an apocalyptic number.
131000320330023 is a deficient number, since it is larger than the sum of its proper divisors (44288364525513).
131000320330023 is a wasteful number, since it uses less digits than its factorization.
131000320330023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 155397770545.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 131000320330023 its reverse (320033023000131), we get a palindrome (451033343330154).
The spelling of 131000320330023 in words is "one hundred thirty-one trillion, three hundred twenty million, three hundred thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •