Base | Representation |
---|---|
bin | 1101011100101101000… |
… | …0010010110101101001 |
3 | 211002100210202101020210 |
4 | 3113023100102311221 |
5 | 12241134042004001 |
6 | 254050112011333 |
7 | 22456316520504 |
oct | 3271320226551 |
9 | 732323671223 |
10 | 231043313001 |
11 | 89a91a21786 |
12 | 3893bb30b49 |
13 | 18a308a7c37 |
14 | b27ad1013b |
15 | 6023987dd6 |
hex | 35cb412d69 |
231043313001 has 8 divisors (see below), whose sum is σ = 308064417760. Its totient is φ = 154025541792.
The previous prime is 231043312987. The next prime is 231043313041. The reversal of 231043313001 is 100313340132.
231043313001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 231043313001 - 210 = 231043311977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (231043313041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 666916 + ... + 952293.
It is an arithmetic number, because the mean of its divisors is an integer number (38508052220).
Almost surely, 2231043313001 is an apocalyptic number.
It is an amenable number.
231043313001 is a deficient number, since it is larger than the sum of its proper divisors (77021104759).
231043313001 is a wasteful number, since it uses less digits than its factorization.
231043313001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1666775.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 231043313001 its reverse (100313340132), we get a palindrome (331356653133).
The spelling of 231043313001 in words is "two hundred thirty-one billion, forty-three million, three hundred thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •