Base | Representation |
---|---|
bin | 101111000000101010010… |
… | …100110010110000000101 |
3 | 102102211112212200001101012 |
4 | 233000222110302300011 |
5 | 410412104012003141 |
6 | 10512025525012005 |
7 | 452253301452122 |
oct | 57005224626005 |
9 | 12384485601335 |
10 | 3230525500421 |
11 | 103607047517a |
12 | 442120554005 |
13 | 1a583905715b |
14 | b2503135749 |
15 | 590779e5ceb |
hex | 2f02a532c05 |
3230525500421 has 8 divisors (see below), whose sum is σ = 3342190425600. Its totient is φ = 3118878408240.
The previous prime is 3230525500417. The next prime is 3230525500427. The reversal of 3230525500421 is 1240055250323.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3230525500421 - 22 = 3230525500417 is a prime.
It is a super-3 number, since 3×32305255004213 (a number of 39 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3230525500427) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4089161 + ... + 4814798.
It is an arithmetic number, because the mean of its divisors is an integer number (417773803200).
Almost surely, 23230525500421 is an apocalyptic number.
It is an amenable number.
3230525500421 is a deficient number, since it is larger than the sum of its proper divisors (111664925179).
3230525500421 is a wasteful number, since it uses less digits than its factorization.
3230525500421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8916499.
The product of its (nonzero) digits is 36000, while the sum is 32.
The spelling of 3230525500421 in words is "three trillion, two hundred thirty billion, five hundred twenty-five million, five hundred thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •