Base | Representation |
---|---|
bin | 101111000001001101001… |
… | …010100001010010010001 |
3 | 102102220001121112012210011 |
4 | 233001031022201102101 |
5 | 410414303130310001 |
6 | 10512203525034521 |
7 | 452303626633516 |
oct | 57011512412221 |
9 | 12386047465704 |
10 | 3231110010001 |
11 | 1036340402945 |
12 | 442264255a41 |
13 | 1a590018b103 |
14 | b255aa0930d |
15 | 590adea3d51 |
hex | 2f04d2a1491 |
3231110010001 has 6 divisors (see below), whose sum is σ = 3410118875202. Its totient is φ = 3061051588080.
The previous prime is 3231110009989. The next prime is 3231110010041. The reversal of 3231110010001 is 1000100111323.
It can be written as a sum of positive squares in only one way, i.e., 2015491302400 + 1215618707601 = 1419680^2 + 1102551^2 .
It is not a de Polignac number, because 3231110010001 - 27 = 3231110009873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3231110010041) 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 5 ways as a sum of consecutive naturals, for example, 4475221260 + ... + 4475221981.
It is an arithmetic number, because the mean of its divisors is an integer number (568353145867).
Almost surely, 23231110010001 is an apocalyptic number.
It is an amenable number.
3231110010001 is a deficient number, since it is larger than the sum of its proper divisors (179008865201).
3231110010001 is an equidigital number, since it uses as much as digits as its factorization.
3231110010001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8950443279 (or 8950443260 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 3231110010001 its reverse (1000100111323), we get a palindrome (4231210121324).
The spelling of 3231110010001 in words is "three trillion, two hundred thirty-one billion, one hundred ten million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •