Base | Representation |
---|---|
bin | 101111000000001100010… |
… | …000010110100101111110 |
3 | 102102210020201101210101021 |
4 | 233000030100112211332 |
5 | 410410040340120110 |
6 | 10511503504134354 |
7 | 452234634444610 |
oct | 57001420264576 |
9 | 12383221353337 |
10 | 3230021020030 |
11 | 1035931728632 |
12 | 441bbb6073ba |
13 | 1a578869394c |
14 | b2496134db0 |
15 | 590485952da |
hex | 2f00c41697e |
3230021020030 has 64 divisors (see below), whose sum is σ = 6794509381632. Its totient is φ = 1082512494720.
The previous prime is 3230021020021. The next prime is 3230021020033. The reversal of 3230021020030 is 300201200323.
It is a super-2 number, since 2×32300210200302 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3230021019986 and 3230021020013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3230021020033) 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 31 ways as a sum of consecutive naturals, for example, 2006215 + ... + 3238045.
It is an arithmetic number, because the mean of its divisors is an integer number (106164209088).
Almost surely, 23230021020030 is an apocalyptic number.
3230021020030 is an abundant number, since it is smaller than the sum of its proper divisors (3564488361602).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3230021020030 is a wasteful number, since it uses less digits than its factorization.
3230021020030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1232689.
The product of its (nonzero) digits is 216, while the sum is 16.
Adding to 3230021020030 its reverse (300201200323), we get a palindrome (3530222220353).
The spelling of 3230021020030 in words is "three trillion, two hundred thirty billion, twenty-one million, twenty thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •