Base | Representation |
---|---|
bin | 100101101011011010011001… |
… | …1001100100101010011111101 |
3 | 1121110110122010201221212200212 |
4 | 1023112310303030211103331 |
5 | 321420004234121114123 |
6 | 3132513100352002205 |
7 | 126544310242440560 |
oct | 11326646314452375 |
9 | 1543418121855625 |
10 | 331422010332413 |
11 | 96668315751330 |
12 | 31207980830365 |
13 | 112c0c66479b60 |
14 | 5bbaca769c4d7 |
15 | 284b0a8c67878 |
hex | 12d6d333254fd |
331422010332413 has 32 divisors (see below), whose sum is σ = 444990994382592. Its totient is φ = 238382891251200.
The previous prime is 331422010332379. The next prime is 331422010332421. The reversal of 331422010332413 is 314233010224133.
It is a cyclic number.
It is not a de Polignac number, because 331422010332413 - 246 = 261053266154749 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 331422010332413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (331422010332493) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 93630683 + ... + 97105863.
It is an arithmetic number, because the mean of its divisors is an integer number (13905968574456).
Almost surely, 2331422010332413 is an apocalyptic number.
It is an amenable number.
331422010332413 is a deficient number, since it is larger than the sum of its proper divisors (113568984050179).
331422010332413 is a wasteful number, since it uses less digits than its factorization.
331422010332413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3570485.
The product of its (nonzero) digits is 31104, while the sum is 32.
Adding to 331422010332413 its reverse (314233010224133), we get a palindrome (645655020556546).
The spelling of 331422010332413 in words is "three hundred thirty-one trillion, four hundred twenty-two billion, ten million, three hundred thirty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •