Base | Representation |
---|---|
bin | 1000110111001100010… |
… | …0000100010011111001 |
3 | 112112222212022220002020 |
4 | 2031303010010103321 |
5 | 4443304100121213 |
6 | 153540014025053 |
7 | 14000001131433 |
oct | 2156304042371 |
9 | 475885286066 |
10 | 152254301433 |
11 | 59630647193 |
12 | 256117a8189 |
13 | 11485614030 |
14 | 7524d25653 |
15 | 3e61975923 |
hex | 23731044f9 |
152254301433 has 16 divisors (see below), whose sum is σ = 218677736256. Its totient is φ = 93670879680.
The previous prime is 152254301413. The next prime is 152254301489. The reversal of 152254301433 is 334103452251.
It is not a de Polignac number, because 152254301433 - 216 = 152254235897 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 152254301394 and 152254301403.
It is not an unprimeable number, because it can be changed into a prime (152254301413) 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 15 ways as a sum of consecutive naturals, for example, 347238 + ... + 651983.
It is an arithmetic number, because the mean of its divisors is an integer number (13667358516).
Almost surely, 2152254301433 is an apocalyptic number.
152254301433 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
152254301433 is a deficient number, since it is larger than the sum of its proper divisors (66423434823).
152254301433 is a wasteful number, since it uses less digits than its factorization.
152254301433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1003144.
The product of its (nonzero) digits is 43200, while the sum is 33.
Adding to 152254301433 its reverse (334103452251), we get a palindrome (486357753684).
The spelling of 152254301433 in words is "one hundred fifty-two billion, two hundred fifty-four million, three hundred one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •