Base | Representation |
---|---|
bin | 1100000010000110… |
… | …0011010110010101 |
3 | 22100002212001211220 |
4 | 3000201203112111 |
5 | 23103341133023 |
6 | 1252302320553 |
7 | 143020503612 |
oct | 30041432625 |
9 | 8302761756 |
10 | 3230021013 |
11 | 140829865a |
12 | 761889159 |
13 | 3c625024b |
14 | 228da1509 |
15 | 13d87d3e3 |
hex | c0863595 |
3230021013 has 8 divisors (see below), whose sum is σ = 4309608576. Its totient is φ = 2151890400.
The previous prime is 3230020991. The next prime is 3230021017. The reversal of 3230021013 is 3101200323.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3230021013 - 217 = 3229889941 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3230020983 and 3230021001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3230021017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 359053 + ... + 367938.
It is an arithmetic number, because the mean of its divisors is an integer number (538701072).
Almost surely, 23230021013 is an apocalyptic number.
It is an amenable number.
3230021013 is a deficient number, since it is larger than the sum of its proper divisors (1079587563).
3230021013 is a wasteful number, since it uses less digits than its factorization.
3230021013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 728475.
The product of its (nonzero) digits is 108, while the sum is 15.
The square root of 3230021013 is about 56833.2738191282. The cubic root of 3230021013 is about 1478.2065280808.
Adding to 3230021013 its reverse (3101200323), we get a palindrome (6331221336).
The spelling of 3230021013 in words is "three billion, two hundred thirty million, twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •