Base | Representation |
---|---|
bin | 1011111111110110111… |
… | …11011011101100011001 |
3 | 1110102001210120111001202 |
4 | 11333323133123230121 |
5 | 23223232222323413 |
6 | 513214143523545 |
7 | 41532502335152 |
oct | 5777337335431 |
9 | 1412053514052 |
10 | 412241214233 |
11 | 149915466882 |
12 | 67a8a8b95b5 |
13 | 2cb4975a584 |
14 | 15d49c50929 |
15 | aacb414e58 |
hex | 5ffb7dbb19 |
412241214233 has 16 divisors (see below), whose sum is σ = 418730850000. Its totient is φ = 405775319040.
The previous prime is 412241214223. The next prime is 412241214257. The reversal of 412241214233 is 332412142214.
It can be written as a sum of positive squares in 8 ways, for example, as 676624144 + 411564590089 = 26012^2 + 641533^2 .
It is a cyclic number.
It is not a de Polignac number, because 412241214233 - 28 = 412241213977 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 412241214196 and 412241214205.
It is not an unprimeable number, because it can be changed into a prime (412241214223) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 91995353 + ... + 91999833.
It is an arithmetic number, because the mean of its divisors is an integer number (26170678125).
Almost surely, 2412241214233 is an apocalyptic number.
It is an amenable number.
412241214233 is a deficient number, since it is larger than the sum of its proper divisors (6489635767).
412241214233 is a wasteful number, since it uses less digits than its factorization.
412241214233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6812.
The product of its digits is 9216, while the sum is 29.
Adding to 412241214233 its reverse (332412142214), we get a palindrome (744653356447).
The spelling of 412241214233 in words is "four hundred twelve billion, two hundred forty-one million, two hundred fourteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •