Base | Representation |
---|---|
bin | 1110101100100000001… |
… | …0001000011111011001 |
3 | 220010122122202101022110 |
4 | 3223020002020133121 |
5 | 13114021302333213 |
6 | 311551433542533 |
7 | 24145203326421 |
oct | 3531002103731 |
9 | 803578671273 |
10 | 252464105433 |
11 | 98084451121 |
12 | 40b19874a49 |
13 | 1aa65731347 |
14 | c30db9b481 |
15 | 68793045c3 |
hex | 3ac80887d9 |
252464105433 has 8 divisors (see below), whose sum is σ = 336627847296. Its totient is φ = 168304883600.
The previous prime is 252464105429. The next prime is 252464105449. The reversal of 252464105433 is 334501464252.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 252464105433 - 22 = 252464105429 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 252464105391 and 252464105400.
It is not an unprimeable number, because it can be changed into a prime (252464105533) 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 7 ways as a sum of consecutive naturals, for example, 997458 + ... + 1224683.
It is an arithmetic number, because the mean of its divisors is an integer number (42078480912).
Almost surely, 2252464105433 is an apocalyptic number.
It is an amenable number.
252464105433 is a deficient number, since it is larger than the sum of its proper divisors (84163741863).
252464105433 is a wasteful number, since it uses less digits than its factorization.
252464105433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2260015.
The product of its (nonzero) digits is 345600, while the sum is 39.
Adding to 252464105433 its reverse (334501464252), we get a palindrome (586965569685).
The spelling of 252464105433 in words is "two hundred fifty-two billion, four hundred sixty-four million, one hundred five thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •