Base | Representation |
---|---|
bin | 1101011101000010011… |
… | …0100010111001000001 |
3 | 211002121001120120120201 |
4 | 3113100212202321001 |
5 | 12241330024011001 |
6 | 254103035005201 |
7 | 22461456233104 |
oct | 3272046427101 |
9 | 732531516521 |
10 | 231133032001 |
11 | 8a028630a13 |
12 | 38965b99801 |
13 | 18a4635bcc1 |
14 | b288bc673b |
15 | 602b7ab501 |
hex | 35d09a2e41 |
231133032001 has 8 divisors (see below), whose sum is σ = 231729214464. Its totient is φ = 230536948800.
The previous prime is 231133031989. The next prime is 231133032059. The reversal of 231133032001 is 100230331132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 231133032001 - 29 = 231133031489 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 231133032001.
It is not an unprimeable number, because it can be changed into a prime (231133030001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7677360 + ... + 7707406.
It is an arithmetic number, because the mean of its divisors is an integer number (28966151808).
Almost surely, 2231133032001 is an apocalyptic number.
It is an amenable number.
231133032001 is a deficient number, since it is larger than the sum of its proper divisors (596182463).
231133032001 is a wasteful number, since it uses less digits than its factorization.
231133032001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49631.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 231133032001 its reverse (100230331132), we get a palindrome (331363363133).
The spelling of 231133032001 in words is "two hundred thirty-one billion, one hundred thirty-three million, thirty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •