Base | Representation |
---|---|
bin | 101110110111100000111110… |
… | …0110101111001001101111101 |
3 | 2000001122201220201110202211021 |
4 | 1131233001330311321031331 |
5 | 413013301440233121140 |
6 | 4020441051011024141 |
7 | 152556045100054510 |
oct | 13557017465711575 |
9 | 2001581821422737 |
10 | 412250235442045 |
11 | 10a3a0385624850 |
12 | 3a2a0a3589b051 |
13 | 14905051a12830 |
14 | 73b3037004d77 |
15 | 329d894873b4a |
hex | 176f07cd7937d |
412250235442045 has 32 divisors (see below), whose sum is σ = 664212966762240. Its totient is φ = 237218916695040.
The previous prime is 412250235442009. The next prime is 412250235442069. The reversal of 412250235442045 is 540244532052214.
It is not a de Polignac number, because 412250235442045 - 223 = 412250227053437 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 412250235441992 and 412250235442010.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 41183834700 + ... + 41183844709.
It is an arithmetic number, because the mean of its divisors is an integer number (20756655211320).
Almost surely, 2412250235442045 is an apocalyptic number.
It is an amenable number.
412250235442045 is a deficient number, since it is larger than the sum of its proper divisors (251962731320195).
412250235442045 is a wasteful number, since it uses less digits than its factorization.
412250235442045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82367679445.
The product of its (nonzero) digits is 1536000, while the sum is 43.
Adding to 412250235442045 its reverse (540244532052214), we get a palindrome (952494767494259).
The spelling of 412250235442045 in words is "four hundred twelve trillion, two hundred fifty billion, two hundred thirty-five million, four hundred forty-two thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •