Base | Representation |
---|---|
bin | 101111000000001011000… |
… | …001011001101011111011 |
3 | 102102210012021110021211120 |
4 | 233000023001121223323 |
5 | 410410020040321243 |
6 | 10511501444400323 |
7 | 452234263514424 |
oct | 57001301315373 |
9 | 12383167407746 |
10 | 3230000323323 |
11 | 1035920a81914 |
12 | 441bb46a60a3 |
13 | 1a57842c8387 |
14 | b24934a864b |
15 | 59046857c83 |
hex | 2f00b059afb |
3230000323323 has 48 divisors (see below), whose sum is σ = 4817544990720. Its totient is φ = 1919259339264.
The previous prime is 3230000323313. The next prime is 3230000323343. The reversal of 3230000323323 is 3233230000323.
3230000323323 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 3230000323323 - 26 = 3230000323259 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3230000323293 and 3230000323302.
It is not an unprimeable number, because it can be changed into a prime (3230000323313) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 44226465 + ... + 44299437.
It is an arithmetic number, because the mean of its divisors is an integer number (100365520640).
Almost surely, 23230000323323 is an apocalyptic number.
3230000323323 is a deficient number, since it is larger than the sum of its proper divisors (1587544667397).
3230000323323 is a wasteful number, since it uses less digits than its factorization.
3230000323323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75716 (or 75699 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 24.
Adding to 3230000323323 its reverse (3233230000323), we get a palindrome (6463230323646).
The spelling of 3230000323323 in words is "three trillion, two hundred thirty billion, three hundred twenty-three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •