Base | Representation |
---|---|
bin | 101011111100111001011… |
… | …001101000110100111110 |
3 | 101200201222122101211201120 |
4 | 223330321121220310332 |
5 | 343441111201444410 |
6 | 10231303531251410 |
7 | 431132320112643 |
oct | 53747131506476 |
9 | 11621878354646 |
10 | 3020325031230 |
11 | a64a04816551 |
12 | 4094388a9b66 |
13 | 18ba7a65aac0 |
14 | a6282429dca |
15 | 53873cb5570 |
hex | 2bf39668d3e |
3020325031230 has 128 divisors (see below), whose sum is σ = 7886883755520. Its totient is φ = 735803481600.
The previous prime is 3020325031193. The next prime is 3020325031249. The reversal of 3020325031230 is 321305230203.
It is a self number, because there is not a number n which added to its sum of digits gives 3020325031230.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 105669081 + ... + 105697659.
It is an arithmetic number, because the mean of its divisors is an integer number (61616279340).
Almost surely, 23020325031230 is an apocalyptic number.
3020325031230 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 3020325031230, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3943441877760).
3020325031230 is an abundant number, since it is smaller than the sum of its proper divisors (4866558724290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3020325031230 is a wasteful number, since it uses less digits than its factorization.
3020325031230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31386.
The product of its (nonzero) digits is 3240, while the sum is 24.
The spelling of 3020325031230 in words is "three trillion, twenty billion, three hundred twenty-five million, thirty-one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •