Base | Representation |
---|---|
bin | 11101110101100000010111… |
… | …011001001101101111000111 |
3 | 122012121112100200021012120111 |
4 | 131311200113121031233013 |
5 | 114144403014212010343 |
6 | 1143025424252413451 |
7 | 36432230464554055 |
oct | 3565402731155707 |
9 | 565545320235514 |
10 | 131220233313223 |
11 | 388a1208889a8a |
12 | 1287343a777287 |
13 | 582b026996b82 |
14 | 24591439831d5 |
15 | 1028515739c9d |
hex | 77581764dbc7 |
131220233313223 has 8 divisors (see below), whose sum is σ = 146251653228720. Its totient is φ = 117001322582400.
The previous prime is 131220233313199. The next prime is 131220233313229. The reversal of 131220233313223 is 322313332022131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131220233313223 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131220233313229) 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, 203127295828 + ... + 203127296473.
It is an arithmetic number, because the mean of its divisors is an integer number (18281456653590).
Almost surely, 2131220233313223 is an apocalyptic number.
131220233313223 is a deficient number, since it is larger than the sum of its proper divisors (15031419915497).
131220233313223 is a wasteful number, since it uses less digits than its factorization.
131220233313223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 406254592337.
The product of its (nonzero) digits is 23328, while the sum is 31.
Adding to 131220233313223 its reverse (322313332022131), we get a palindrome (453533565335354).
The spelling of 131220233313223 in words is "one hundred thirty-one trillion, two hundred twenty billion, two hundred thirty-three million, three hundred thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •