Base | Representation |
---|---|
bin | 1100000001110110110… |
… | …01001001111000011001 |
3 | 1110111211111220121022000 |
4 | 12000323121021320121 |
5 | 23232431201411413 |
6 | 513512402351213 |
7 | 41601201112365 |
oct | 6007331117031 |
9 | 1414744817260 |
10 | 413313310233 |
11 | 14a31565242a |
12 | 6812995b509 |
13 | 2cc8a8bb2c5 |
14 | 1600c3a82a5 |
15 | ab405d8073 |
hex | 603b649e19 |
413313310233 has 16 divisors (see below), whose sum is σ = 612459552000. Its totient is φ = 275477615280.
The previous prime is 413313310231. The next prime is 413313310253. The reversal of 413313310233 is 332013313314.
413313310233 is a `hidden beast` number, since 4 + 1 + 3 + 313 + 310 + 2 + 33 = 666.
It is not a de Polignac number, because 413313310233 - 21 = 413313310231 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 413313310197 and 413313310206.
It is not an unprimeable number, because it can be changed into a prime (413313310231) 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, 1676758 + ... + 1907391.
It is an arithmetic number, because the mean of its divisors is an integer number (38278722000).
Almost surely, 2413313310233 is an apocalyptic number.
It is an amenable number.
413313310233 is a deficient number, since it is larger than the sum of its proper divisors (199146241767).
413313310233 is a wasteful number, since it uses less digits than its factorization.
413313310233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3588429 (or 3588423 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 27.
Adding to 413313310233 its reverse (332013313314), we get a palindrome (745326623547).
The spelling of 413313310233 in words is "four hundred thirteen billion, three hundred thirteen million, three hundred ten thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •