Base | Representation |
---|---|
bin | 1000110011011000101… |
… | …0000010011111001001 |
3 | 112110100122112210120010 |
4 | 2030312022002133021 |
5 | 4434211002103044 |
6 | 153250352222133 |
7 | 13632452446221 |
oct | 2146612023711 |
9 | 473318483503 |
10 | 151232456649 |
11 | 5915686306a |
12 | 2538753a949 |
13 | 113519c8b51 |
14 | 746932d081 |
15 | 3e01dcbbb9 |
hex | 23362827c9 |
151232456649 has 4 divisors (see below), whose sum is σ = 201643275536. Its totient is φ = 100821637764.
The previous prime is 151232456593. The next prime is 151232456651. The reversal of 151232456649 is 946654232151.
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.
It is not a de Polignac number, because 151232456649 - 213 = 151232448457 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 151232456598 and 151232456607.
It is not an unprimeable number, because it can be changed into a prime (151232456659) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25205409439 + ... + 25205409444.
It is an arithmetic number, because the mean of its divisors is an integer number (50410818884).
Almost surely, 2151232456649 is an apocalyptic number.
It is an amenable number.
151232456649 is a deficient number, since it is larger than the sum of its proper divisors (50410818887).
151232456649 is an equidigital number, since it uses as much as digits as its factorization.
151232456649 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50410818886.
The product of its digits is 1555200, while the sum is 48.
The spelling of 151232456649 in words is "one hundred fifty-one billion, two hundred thirty-two million, four hundred fifty-six thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •