Base | Representation |
---|---|
bin | 1000110110000111000… |
… | …0000010100001001001 |
3 | 112112020121202211220012 |
4 | 2031201300002201021 |
5 | 4442210220313122 |
6 | 153451120241305 |
7 | 13656543213020 |
oct | 2154160024111 |
9 | 475217684805 |
10 | 151963838537 |
11 | 594a1697105 |
12 | 25550470235 |
13 | 1143a3a51b4 |
14 | 74d85158b7 |
15 | 3e461ec7e2 |
hex | 2361c02849 |
151963838537 has 4 divisors (see below), whose sum is σ = 173672958336. Its totient is φ = 130254718740.
The previous prime is 151963838513. The next prime is 151963838549. The reversal of 151963838537 is 735838369151.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 735838369151 = 53503 ⋅13753217.
It is a cyclic number.
It is not a de Polignac number, because 151963838537 - 28 = 151963838281 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (151963838737) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10854559889 + ... + 10854559902.
It is an arithmetic number, because the mean of its divisors is an integer number (43418239584).
Almost surely, 2151963838537 is an apocalyptic number.
It is an amenable number.
151963838537 is a deficient number, since it is larger than the sum of its proper divisors (21709119799).
151963838537 is an equidigital number, since it uses as much as digits as its factorization.
151963838537 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21709119798.
The product of its digits is 16329600, while the sum is 59.
The spelling of 151963838537 in words is "one hundred fifty-one billion, nine hundred sixty-three million, eight hundred thirty-eight thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •