Base | Representation |
---|---|
bin | 101110100101010110011… |
… | …100110010000001010010 |
3 | 102100000212012111011001011 |
4 | 232211112130302001102 |
5 | 404422024430133020 |
6 | 10450340023401134 |
7 | 450164513501056 |
oct | 56452634620122 |
9 | 12300765434034 |
10 | 3201201021010 |
11 | 1024692580823 |
12 | 4384b78b31aa |
13 | 1a2b449101a5 |
14 | b0d206d1c66 |
15 | 5840d35635a |
hex | 2e956732052 |
3201201021010 has 8 divisors (see below), whose sum is σ = 5762161837836. Its totient is φ = 1280480408400.
The previous prime is 3201201020951. The next prime is 3201201021017. The reversal of 3201201021010 is 101201021023.
It can be written as a sum of positive squares in 2 ways, for example, as 3024875773089 + 176325247921 = 1739217^2 + 419911^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×32012010210102 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (3201201021017) 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 3 ways as a sum of consecutive naturals, for example, 160060051041 + ... + 160060051060.
Almost surely, 23201201021010 is an apocalyptic number.
3201201021010 is a deficient number, since it is larger than the sum of its proper divisors (2560960816826).
3201201021010 is a wasteful number, since it uses less digits than its factorization.
3201201021010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 320120102108.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 3201201021010 its sum of digits (13), we get a palindrome (3201201021023).
Adding to 3201201021010 its reverse (101201021023), we get a palindrome (3302402042033).
The spelling of 3201201021010 in words is "three trillion, two hundred one billion, two hundred one million, twenty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •