Base | Representation |
---|---|
bin | 1101100000010001011… |
… | …0110001001001000101 |
3 | 211011211120101201212022 |
4 | 3120010112301021011 |
5 | 12300114313430201 |
6 | 254325133132525 |
7 | 22522131415454 |
oct | 3300426611105 |
9 | 734746351768 |
10 | 232001311301 |
11 | 8a433768011 |
12 | 38b6892a145 |
13 | 18b541ca436 |
14 | b32c246b9b |
15 | 607cb1e41b |
hex | 36045b1245 |
232001311301 has 4 divisors (see below), whose sum is σ = 232159029504. Its totient is φ = 231843593100.
The previous prime is 232001311271. The next prime is 232001311309. The reversal of 232001311301 is 103113100232.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 232001311301 - 222 = 231997116997 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 232001311301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232001311309) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 78856895 + ... + 78859836.
It is an arithmetic number, because the mean of its divisors is an integer number (58039757376).
Almost surely, 2232001311301 is an apocalyptic number.
It is an amenable number.
232001311301 is a deficient number, since it is larger than the sum of its proper divisors (157718203).
232001311301 is a wasteful number, since it uses less digits than its factorization.
232001311301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157718202.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 232001311301 its reverse (103113100232), we get a palindrome (335114411533).
The spelling of 232001311301 in words is "two hundred thirty-two billion, one million, three hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •