Base | Representation |
---|---|
bin | 11101110010010011010010… |
… | …111111100011010110010111 |
3 | 122011211111000012020000112121 |
4 | 131302103102333203112113 |
5 | 114132301041323400343 |
6 | 1142340331053200411 |
7 | 36410304112655200 |
oct | 3562232277432627 |
9 | 564744005200477 |
10 | 131000042403223 |
11 | 38816895855304 |
12 | 12838829190107 |
13 | 5813335579396 |
14 | 244c6160c25a7 |
15 | 10229298d8aed |
hex | 7724d2fe3597 |
131000042403223 has 12 divisors (see below), whose sum is σ = 152395216377240. Its totient is φ = 112280289195312.
The previous prime is 131000042403133. The next prime is 131000042403281. The reversal of 131000042403223 is 322304240000131.
It is not a de Polignac number, because 131000042403223 - 213 = 131000042395031 is a prime.
It is a super-2 number, since 2×1310000424032232 (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 (131000042403623) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 63999228 + ... + 66014401.
It is an arithmetic number, because the mean of its divisors is an integer number (12699601364770).
Almost surely, 2131000042403223 is an apocalyptic number.
131000042403223 is a deficient number, since it is larger than the sum of its proper divisors (21395173974017).
131000042403223 is a wasteful number, since it uses less digits than its factorization.
131000042403223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 130034206 (or 130034199 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 131000042403223 its reverse (322304240000131), we get a palindrome (453304282403354).
The spelling of 131000042403223 in words is "one hundred thirty-one trillion, forty-two million, four hundred three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •