Base | Representation |
---|---|
bin | 1101001010010110000… |
… | …10100000010101111001 |
3 | 1121020021201111101122211 |
4 | 12211023002200111321 |
5 | 24402132002422131 |
6 | 543430221215121 |
7 | 44446456642105 |
oct | 6451302402571 |
9 | 1536251441584 |
10 | 452230514041 |
11 | 164876376689 |
12 | 7378b1014a1 |
13 | 33850534657 |
14 | 17c60c34905 |
15 | bb6bed65b1 |
hex | 694b0a0579 |
452230514041 has 8 divisors (see below), whose sum is σ = 452481165344. Its totient is φ = 451979922240.
The previous prime is 452230514039. The next prime is 452230514051. The reversal of 452230514041 is 140415032254.
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 452230514041 - 21 = 452230514039 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 452230513994 and 452230514012.
It is not an unprimeable number, because it can be changed into a prime (452230514051) 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, 29524801 + ... + 29540113.
It is an arithmetic number, because the mean of its divisors is an integer number (56560145668).
Almost surely, 2452230514041 is an apocalyptic number.
It is an amenable number.
452230514041 is a deficient number, since it is larger than the sum of its proper divisors (250651303).
452230514041 is a wasteful number, since it uses less digits than its factorization.
452230514041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29751.
The product of its (nonzero) digits is 19200, while the sum is 31.
Adding to 452230514041 its reverse (140415032254), we get a palindrome (592645546295).
The spelling of 452230514041 in words is "four hundred fifty-two billion, two hundred thirty million, five hundred fourteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •