Base | Representation |
---|---|
bin | 100100110000001… |
… | …0101001110011001 |
3 | 10011221111200021010 |
4 | 1021200111032121 |
5 | 10011200243223 |
6 | 322212004133 |
7 | 42363063114 |
oct | 11140251631 |
9 | 3157450233 |
10 | 1233212313 |
11 | 583130733 |
12 | 2a5000649 |
13 | 168652638 |
14 | b9ad757b |
15 | 733eb393 |
hex | 49815399 |
1233212313 has 8 divisors (see below), whose sum is σ = 1661234848. Its totient is φ = 813665664.
The previous prime is 1233212311. The next prime is 1233212363. The reversal of 1233212313 is 3132123321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1233212313 - 21 = 1233212311 is a prime.
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 1233212313.
It is not an unprimeable number, because it can be changed into a prime (1233212311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2118631 + ... + 2119212.
It is an arithmetic number, because the mean of its divisors is an integer number (207654356).
Almost surely, 21233212313 is an apocalyptic number.
It is an amenable number.
1233212313 is a deficient number, since it is larger than the sum of its proper divisors (428022535).
1233212313 is an equidigital number, since it uses as much as digits as its factorization.
1233212313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4237943.
The product of its digits is 648, while the sum is 21.
The square root of 1233212313 is about 35117.1227893175. The cubic root of 1233212313 is about 1072.3731972819.
Adding to 1233212313 its reverse (3132123321), we get a palindrome (4365335634).
The spelling of 1233212313 in words is "one billion, two hundred thirty-three million, two hundred twelve thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •