Base | Representation |
---|---|
bin | 101110100101011000001… |
… | …100100001001111011101 |
3 | 102100000221020121022021221 |
4 | 232211120030201033131 |
5 | 404422104424444123 |
6 | 10450342551253341 |
7 | 450165320455540 |
oct | 56453014411735 |
9 | 12300836538257 |
10 | 3201230312413 |
11 | 10246a80678a1 |
12 | 43850567a251 |
13 | 1a2b4a9c7793 |
14 | b0d24558857 |
15 | 58410be025d |
hex | 2e9583213dd |
3201230312413 has 16 divisors (see below), whose sum is σ = 3661150953600. Its totient is φ = 2741960894400.
The previous prime is 3201230312363. The next prime is 3201230312471. The reversal of 3201230312413 is 3142130321023.
3201230312413 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3201230312413 - 225 = 3201196757981 is a prime.
It is a super-2 number, since 2×32012303124132 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3201230312113) 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, 59408103 + ... + 59461963.
It is an arithmetic number, because the mean of its divisors is an integer number (228821934600).
Almost surely, 23201230312413 is an apocalyptic number.
It is an amenable number.
3201230312413 is a deficient number, since it is larger than the sum of its proper divisors (459920641187).
3201230312413 is a wasteful number, since it uses less digits than its factorization.
3201230312413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59748.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 3201230312413 its reverse (3142130321023), we get a palindrome (6343360633436).
The spelling of 3201230312413 in words is "three trillion, two hundred one billion, two hundred thirty million, three hundred twelve thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •