Base | Representation |
---|---|
bin | 1011111111011110000… |
… | …10111101010110100011 |
3 | 1110101112020200210210101 |
4 | 11333233002331112203 |
5 | 23222320300021311 |
6 | 513141324443231 |
7 | 41524355545264 |
oct | 5775702752643 |
9 | 1411466623711 |
10 | 412032423331 |
11 | 14981861a111 |
12 | 67a309a9517 |
13 | 2cb15415b69 |
14 | 15d2a22096b |
15 | aab7e20ec1 |
hex | 5fef0bd5a3 |
412032423331 has 4 divisors (see below), whose sum is σ = 412044772072. Its totient is φ = 412020074592.
The previous prime is 412032423329. The next prime is 412032423337. The reversal of 412032423331 is 133324230214.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 412032423331 - 21 = 412032423329 is a prime.
It is a super-2 number, since 2×4120324233312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 412032423331.
It is not an unprimeable number, because it can be changed into a prime (412032423337) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6124185 + ... + 6191098.
It is an arithmetic number, because the mean of its divisors is an integer number (103011193018).
Almost surely, 2412032423331 is an apocalyptic number.
412032423331 is a deficient number, since it is larger than the sum of its proper divisors (12348741).
412032423331 is a wasteful number, since it uses less digits than its factorization.
412032423331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12348740.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 412032423331 its reverse (133324230214), we get a palindrome (545356653545).
The spelling of 412032423331 in words is "four hundred twelve billion, thirty-two million, four hundred twenty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •