Base | Representation |
---|---|
bin | 11101110010100111001101… |
… | …111111000001000001011111 |
3 | 122011220112012221210202011102 |
4 | 131302213031333001001133 |
5 | 114133123343400304043 |
6 | 1142354225424343315 |
7 | 36411662153600153 |
oct | 3562471577010137 |
9 | 564815187722142 |
10 | 131021433213023 |
11 | 38824972366311 |
12 | 128409b8a74b3b |
13 | 58153641356a2 |
14 | 244d684da7063 |
15 | 102327c7d16b8 |
hex | 7729cdfc105f |
131021433213023 has 16 divisors (see below), whose sum is σ = 134184437637120. Its totient is φ = 127907807934816.
The previous prime is 131021433213017. The next prime is 131021433213059. The reversal of 131021433213023 is 320312334120131.
It is a cyclic number.
It is not a de Polignac number, because 131021433213023 - 24 = 131021433213007 is a prime.
It is a super-2 number, since 2×1310214332130232 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131021438213023) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29844893 + ... + 33952326.
It is an arithmetic number, because the mean of its divisors is an integer number (8386527352320).
Almost surely, 2131021433213023 is an apocalyptic number.
131021433213023 is a deficient number, since it is larger than the sum of its proper divisors (3163004424097).
131021433213023 is a wasteful number, since it uses less digits than its factorization.
131021433213023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63797606.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 131021433213023 its reverse (320312334120131), we get a palindrome (451333767333154).
The spelling of 131021433213023 in words is "one hundred thirty-one trillion, twenty-one billion, four hundred thirty-three million, two hundred thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •