Base | Representation |
---|---|
bin | 100100100010101000111101… |
… | …0111000100001100010011001 |
3 | 1120011001110210202121210221111 |
4 | 1021011101322320201202121 |
5 | 314112122114423414431 |
6 | 3055334230034140321 |
7 | 124462563016160260 |
oct | 11105217270414231 |
9 | 1504043722553844 |
10 | 321420234201241 |
11 | 9346161288670a |
12 | 3007148a1216a1 |
13 | 10a46a4b36a956 |
14 | 5952b7270b5d7 |
15 | 2725d27e337b1 |
hex | 124547ae21899 |
321420234201241 has 16 divisors (see below), whose sum is σ = 388946003472000. Its totient is φ = 259296655668480.
The previous prime is 321420234201233. The next prime is 321420234201263. The reversal of 321420234201241 is 142102432024123.
It is a cyclic number.
It is not a de Polignac number, because 321420234201241 - 23 = 321420234201233 is a prime.
It is a super-2 number, since 2×3214202342012412 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (321420234241241) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 131053351 + ... + 133483411.
It is an arithmetic number, because the mean of its divisors is an integer number (24309125217000).
Almost surely, 2321420234201241 is an apocalyptic number.
It is an amenable number.
321420234201241 is a deficient number, since it is larger than the sum of its proper divisors (67525769270759).
321420234201241 is a wasteful number, since it uses less digits than its factorization.
321420234201241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3541584.
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 321420234201241 its reverse (142102432024123), we get a palindrome (463522666225364).
The spelling of 321420234201241 in words is "three hundred twenty-one trillion, four hundred twenty billion, two hundred thirty-four million, two hundred one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •