Base | Representation |
---|---|
bin | 100100100010101000110111… |
… | …0110011000001011001101110 |
3 | 1120011001110021122002002020210 |
4 | 1021011101232303001121232 |
5 | 314112121211021313202 |
6 | 3055334153552123250 |
7 | 124462555004521215 |
oct | 11105215663013156 |
9 | 1504043248062223 |
10 | 321420031432302 |
11 | 93461519382380 |
12 | 30071432236526 |
13 | 10a46a1835422a |
14 | 5952b5380807c |
15 | 2725d1522dc6c |
hex | 124546ecc166e |
321420031432302 has 32 divisors (see below), whose sum is σ = 717588907390080. Its totient is φ = 95134893023520.
The previous prime is 321420031432273. The next prime is 321420031432321. The reversal of 321420031432302 is 203234130024123.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 321420031432302.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 56627909677 + ... + 56627915352.
It is an arithmetic number, because the mean of its divisors is an integer number (22424653355940).
Almost surely, 2321420031432302 is an apocalyptic number.
321420031432302 is an abundant number, since it is smaller than the sum of its proper divisors (396168875957778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
321420031432302 is a wasteful number, since it uses less digits than its factorization.
321420031432302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113255825088.
The product of its (nonzero) digits is 20736, while the sum is 30.
Adding to 321420031432302 its reverse (203234130024123), we get a palindrome (524654161456425).
The spelling of 321420031432302 in words is "three hundred twenty-one trillion, four hundred twenty billion, thirty-one million, four hundred thirty-two thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •