Base | Representation |
---|---|
bin | 101011110000010001000… |
… | …0100101100110110000001 |
3 | 210021212221221212001010111 |
4 | 1113200202010230312001 |
5 | 1242011200110401001 |
6 | 20442324201231321 |
7 | 1160314530346264 |
oct | 127404204546601 |
9 | 23255857761114 |
10 | 6013525872001 |
11 | 1a0935a64526a |
12 | 811565792541 |
13 | 3480c467495b |
14 | 16b0b0326cdb |
15 | a665b663851 |
hex | 5782212cd81 |
6013525872001 has 2 divisors, whose sum is σ = 6013525872002. Its totient is φ = 6013525872000.
The previous prime is 6013525871981. The next prime is 6013525872041. The reversal of 6013525872001 is 1002785253106.
It is an a-pointer prime, because the next prime (6013525872041) can be obtained adding 6013525872001 to its sum of digits (40).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3507383585601 + 2506142286400 = 1872801^2 + 1583080^2 .
It is a cyclic number.
It is not a de Polignac number, because 6013525872001 - 29 = 6013525871489 is a prime.
It is not a weakly prime, because it can be changed into another prime (6013525872041) 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 as a sum of consecutive naturals, namely, 3006762936000 + 3006762936001.
It is an arithmetic number, because the mean of its divisors is an integer number (3006762936001).
Almost surely, 26013525872001 is an apocalyptic number.
It is an amenable number.
6013525872001 is a deficient number, since it is larger than the sum of its proper divisors (1).
6013525872001 is an equidigital number, since it uses as much as digits as its factorization.
6013525872001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 100800, while the sum is 40.
The spelling of 6013525872001 in words is "six trillion, thirteen billion, five hundred twenty-five million, eight hundred seventy-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •