Base | Representation |
---|---|
bin | 11101110111000111000011… |
… | …110011110100101101010111 |
3 | 122020000001222100210000010211 |
4 | 131313013003303310231113 |
5 | 114203204331014332101 |
6 | 1143152222053430251 |
7 | 36443213136331426 |
oct | 3567070363645527 |
9 | 566001870700124 |
10 | 131330500152151 |
11 | 38933a52614133 |
12 | 1289089293b387 |
13 | 583854a550b21 |
14 | 24606043872bd |
15 | 102b31ae90c51 |
hex | 7771c3cf4b57 |
131330500152151 has 32 divisors (see below), whose sum is σ = 135492084129600. Its totient is φ = 127222026624000.
The previous prime is 131330500151959. The next prime is 131330500152161. The reversal of 131330500152151 is 151251005033131.
It is a cyclic number.
It is not a de Polignac number, because 131330500152151 - 29 = 131330500151639 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 (131330500152161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13264362301 + ... + 13264372201.
It is an arithmetic number, because the mean of its divisors is an integer number (4234127629050).
Almost surely, 2131330500152151 is an apocalyptic number.
131330500152151 is a deficient number, since it is larger than the sum of its proper divisors (4161583977449).
131330500152151 is a wasteful number, since it uses less digits than its factorization.
131330500152151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13027.
The product of its (nonzero) digits is 6750, while the sum is 31.
Adding to 131330500152151 its reverse (151251005033131), we get a palindrome (282581505185282).
The spelling of 131330500152151 in words is "one hundred thirty-one trillion, three hundred thirty billion, five hundred million, one hundred fifty-two thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •