Base | Representation |
---|---|
bin | 1000110111110110011… |
… | …0100100010010010101 |
3 | 112120110012001002002000 |
4 | 2031331212210102111 |
5 | 4444134331224321 |
6 | 154005331505513 |
7 | 14004246056160 |
oct | 2157546442225 |
9 | 476405032060 |
10 | 152431117461 |
11 | 59711434737 |
12 | 25660a58299 |
13 | 114b31418bc |
14 | 75405d0ad7 |
15 | 3e72250826 |
hex | 237d9a4495 |
152431117461 has 16 divisors (see below), whose sum is σ = 258084432000. Its totient is φ = 87103495584.
The previous prime is 152431117393. The next prime is 152431117463. The reversal of 152431117461 is 164711134251.
152431117461 is a `hidden beast` number, since 1 + 52 + 4 + 31 + 117 + 461 = 666.
152431117461 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 152431117461 - 214 = 152431101077 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152431117463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 403256736 + ... + 403257113.
It is an arithmetic number, because the mean of its divisors is an integer number (16130277000).
Almost surely, 2152431117461 is an apocalyptic number.
It is an amenable number.
152431117461 is a deficient number, since it is larger than the sum of its proper divisors (105653314539).
152431117461 is an equidigital number, since it uses as much as digits as its factorization.
152431117461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 806513865 (or 806513859 counting only the distinct ones).
The product of its digits is 20160, while the sum is 36.
The spelling of 152431117461 in words is "one hundred fifty-two billion, four hundred thirty-one million, one hundred seventeen thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •