Base | Representation |
---|---|
bin | 101100000010001011110… |
… | …110001001000010110111 |
3 | 101201021122100212211000020 |
4 | 230002023312021002313 |
5 | 344034223304432411 |
6 | 10234043210220223 |
7 | 431423115554232 |
oct | 54021366110267 |
9 | 11637570784006 |
10 | 3026003202231 |
11 | a67358a13459 |
12 | 40a562424673 |
13 | 18c473b54cb9 |
14 | a66605c2419 |
15 | 53aa752b606 |
hex | 2c08bd890b7 |
3026003202231 has 8 divisors (see below), whose sum is σ = 4051987121520. Its totient is φ = 2008677375552.
The previous prime is 3026003202193. The next prime is 3026003202289. The reversal of 3026003202231 is 1322023006203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3026003202231 - 217 = 3026003071159 is a prime.
It is a super-2 number, since 2×30260032022312 (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 (3026003202631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2164522336 + ... + 2164523733.
It is an arithmetic number, because the mean of its divisors is an integer number (506498390190).
Almost surely, 23026003202231 is an apocalyptic number.
3026003202231 is a deficient number, since it is larger than the sum of its proper divisors (1025983919289).
3026003202231 is a wasteful number, since it uses less digits than its factorization.
3026003202231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4329046305.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 3026003202231 its reverse (1322023006203), we get a palindrome (4348026208434).
The spelling of 3026003202231 in words is "three trillion, twenty-six billion, three million, two hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •