Base | Representation |
---|---|
bin | 100100011010000000001010… |
… | …0110001110110001110001111 |
3 | 1112222211222122001101021101120 |
4 | 1020310000110301312032033 |
5 | 313433144402202414411 |
6 | 3053025020535012023 |
7 | 124311035666520633 |
oct | 11064002461661617 |
9 | 1488758561337346 |
10 | 320233110201231 |
11 | 93044110280a27 |
12 | 2babb3a480a013 |
13 | 1098bb1155a166 |
14 | 59115182b0dc3 |
15 | 2704ee8854106 |
hex | 1234014c7638f |
320233110201231 has 24 divisors (see below), whose sum is σ = 453829092963840. Its totient is φ = 200816347988352.
The previous prime is 320233110201203. The next prime is 320233110201341. The reversal of 320233110201231 is 132102011332023.
It is not a de Polignac number, because 320233110201231 - 218 = 320233109939087 is a prime.
It is a super-2 number, since 2×3202331102012312 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (320233110200231) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 103465761 + ... + 106515866.
It is an arithmetic number, because the mean of its divisors is an integer number (18909545540160).
Almost surely, 2320233110201231 is an apocalyptic number.
320233110201231 is a deficient number, since it is larger than the sum of its proper divisors (133595982762609).
320233110201231 is a wasteful number, since it uses less digits than its factorization.
320233110201231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 209983423 (or 209983406 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 320233110201231 its reverse (132102011332023), we get a palindrome (452335121533254).
The spelling of 320233110201231 in words is "three hundred twenty trillion, two hundred thirty-three billion, one hundred ten million, two hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •