Base | Representation |
---|---|
bin | 1011111111111000010… |
… | …01001001101000111011 |
3 | 1110102002120011002120102 |
4 | 11333330021021220323 |
5 | 23223243022302311 |
6 | 513215214150015 |
7 | 41532664313630 |
oct | 5777411115073 |
9 | 1412076132512 |
10 | 412252150331 |
11 | 14992065627a |
12 | 67a924b230b |
13 | 2cb4bab9238 |
14 | 15d4b49a187 |
15 | aacc37543b |
hex | 5ffc249a3b |
412252150331 has 8 divisors (see below), whose sum is σ = 472408441824. Its totient is φ = 352411640640.
The previous prime is 412252150319. The next prime is 412252150423. The reversal of 412252150331 is 133051252214.
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 412252150331 - 222 = 412247956027 is a prime.
It is a super-2 number, since 2×4122521503312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 412252150294 and 412252150303.
It is not an unprimeable number, because it can be changed into a prime (412252180331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 78942650 + ... + 78947871.
It is an arithmetic number, because the mean of its divisors is an integer number (59051055228).
Almost surely, 2412252150331 is an apocalyptic number.
412252150331 is a deficient number, since it is larger than the sum of its proper divisors (60156291493).
412252150331 is a wasteful number, since it uses less digits than its factorization.
412252150331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157890901.
The product of its (nonzero) digits is 7200, while the sum is 29.
The spelling of 412252150331 in words is "four hundred twelve billion, two hundred fifty-two million, one hundred fifty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •