Base | Representation |
---|---|
bin | 101101101100111100111110… |
… | …100001000001101000010001 |
3 | 222100200112021211222002202212 |
4 | 231230330332201001220101 |
5 | 202321201001133032241 |
6 | 1551254404240121505 |
7 | 60223600456231331 |
oct | 5554747641015021 |
9 | 870615254862685 |
10 | 201001223330321 |
11 | 5905515a52a437 |
12 | 1a663473006295 |
13 | 8820445b2a0cb |
14 | 378c7227110c1 |
15 | 1838782dedbeb |
hex | b6cf3e841a11 |
201001223330321 has 16 divisors (see below), whose sum is σ = 201345987427200. Its totient is φ = 200656810972800.
The previous prime is 201001223330251. The next prime is 201001223330381. The reversal of 201001223330321 is 123033322100102.
It is a cyclic number.
It is not a de Polignac number, because 201001223330321 - 210 = 201001223329297 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201001223330381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13427824925 + ... + 13427839893.
It is an arithmetic number, because the mean of its divisors is an integer number (12584124214200).
Almost surely, 2201001223330321 is an apocalyptic number.
It is an amenable number.
201001223330321 is a deficient number, since it is larger than the sum of its proper divisors (344764096879).
201001223330321 is a wasteful number, since it uses less digits than its factorization.
201001223330321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25240.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 201001223330321 its reverse (123033322100102), we get a palindrome (324034545430423).
The spelling of 201001223330321 in words is "two hundred one trillion, one billion, two hundred twenty-three million, three hundred thirty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •