Base | Representation |
---|---|
bin | 1000001111001011010… |
… | …1110101011101011111 |
3 | 111112021021221222112212 |
4 | 2003302311311131133 |
5 | 4304304331333401 |
6 | 145002113551035 |
7 | 13136553643124 |
oct | 2036265653537 |
9 | 445237858485 |
10 | 141513152351 |
11 | 5501953797a |
12 | 2351457547b |
13 | 1046320a90c |
14 | 6bc659674b |
15 | 3a339b7dbb |
hex | 20f2d7575f |
141513152351 has 2 divisors, whose sum is σ = 141513152352. Its totient is φ = 141513152350.
The previous prime is 141513152311. The next prime is 141513152353. The reversal of 141513152351 is 153251315141.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 141513152351 - 234 = 124333283167 is a prime.
Together with 141513152353, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141513152353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70756576175 + 70756576176.
It is an arithmetic number, because the mean of its divisors is an integer number (70756576176).
Almost surely, 2141513152351 is an apocalyptic number.
141513152351 is a deficient number, since it is larger than the sum of its proper divisors (1).
141513152351 is an equidigital number, since it uses as much as digits as its factorization.
141513152351 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 9000, while the sum is 32.
Adding to 141513152351 its reverse (153251315141), we get a palindrome (294764467492).
The spelling of 141513152351 in words is "one hundred forty-one billion, five hundred thirteen million, one hundred fifty-two thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •