Base | Representation |
---|---|
bin | 1100000001101001100… |
… | …01110011010111111101 |
3 | 1110111112210002021120222 |
4 | 12000310301303113331 |
5 | 23232214244044013 |
6 | 513453355551125 |
7 | 41565352602224 |
oct | 6006461632775 |
9 | 1414483067528 |
10 | 413202331133 |
11 | 14a268a42169 |
12 | 680b875b4a5 |
13 | 2cc709023b7 |
14 | 15ddb759cbb |
15 | ab359b5508 |
hex | 6034c735fd |
413202331133 has 4 divisors (see below), whose sum is σ = 414156609468. Its totient is φ = 412248052800.
The previous prime is 413202331093. The next prime is 413202331141. The reversal of 413202331133 is 331133202314.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 120102447364 + 293099883769 = 346558^2 + 541387^2 .
It is a cyclic number.
It is not a de Polignac number, because 413202331133 - 210 = 413202330109 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (413202331183) 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, 477138518 + ... + 477139383.
It is an arithmetic number, because the mean of its divisors is an integer number (103539152367).
Almost surely, 2413202331133 is an apocalyptic number.
It is an amenable number.
413202331133 is a deficient number, since it is larger than the sum of its proper divisors (954278335).
413202331133 is an equidigital number, since it uses as much as digits as its factorization.
413202331133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 954278334.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 413202331133 its reverse (331133202314), we get a palindrome (744335533447).
The spelling of 413202331133 in words is "four hundred thirteen billion, two hundred two million, three hundred thirty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •