Base | Representation |
---|---|
bin | 101111000000010111110… |
… | …101100110011010001001 |
3 | 102102210202021000221100221 |
4 | 233000113311212122021 |
5 | 410410440111133023 |
6 | 10511535045030041 |
7 | 452242514206330 |
oct | 57002765463211 |
9 | 12383667027327 |
10 | 3230215333513 |
11 | 1035a21387193 |
12 | 4420546b5321 |
13 | 1a57b9a0983c |
14 | b24b3c76d17 |
15 | 5905a67985d |
hex | 2f017d66689 |
3230215333513 has 8 divisors (see below), whose sum is σ = 3691751771520. Its totient is φ = 2768698171680.
The previous prime is 3230215333507. The next prime is 3230215333559. The reversal of 3230215333513 is 3153335120323.
3230215333513 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3230215333513 - 29 = 3230215333001 is a prime.
It is a super-2 number, since 2×32302153335132 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3230215330513) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4458148 + ... + 5131813.
It is an arithmetic number, because the mean of its divisors is an integer number (461468971440).
Almost surely, 23230215333513 is an apocalyptic number.
It is an amenable number.
3230215333513 is a deficient number, since it is larger than the sum of its proper divisors (461536438007).
3230215333513 is an equidigital number, since it uses as much as digits as its factorization.
3230215333513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9638087.
The product of its (nonzero) digits is 72900, while the sum is 34.
The spelling of 3230215333513 in words is "three trillion, two hundred thirty billion, two hundred fifteen million, three hundred thirty-three thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •