Base | Representation |
---|---|
bin | 101111000010001001011… |
… | …100010010110001011001 |
3 | 102102222200002110011202021 |
4 | 233002021130102301121 |
5 | 410423341023131410 |
6 | 10512452132334441 |
7 | 452340656525143 |
oct | 57021134226131 |
9 | 12388602404667 |
10 | 3232121302105 |
11 | 103680a239643 |
12 | 4424a6a74421 |
13 | 1a5a3184ccc7 |
14 | b2615055c93 |
15 | 5911cb65eda |
hex | 2f089712c59 |
3232121302105 has 16 divisors (see below), whose sum is σ = 4048402276224. Its totient is φ = 2472527249280.
The previous prime is 3232121302099. The next prime is 3232121302127. The reversal of 3232121302105 is 5012031212323.
It is not a de Polignac number, because 3232121302105 - 241 = 1033098046553 is a prime.
It is a super-2 number, since 2×32321213021052 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3232121302105.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 3869076 + ... + 4629685.
It is an arithmetic number, because the mean of its divisors is an integer number (253025142264).
Almost surely, 23232121302105 is an apocalyptic number.
It is an amenable number.
3232121302105 is a deficient number, since it is larger than the sum of its proper divisors (816280974119).
3232121302105 is a wasteful number, since it uses less digits than its factorization.
3232121302105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8502096.
The product of its (nonzero) digits is 2160, while the sum is 25.
Adding to 3232121302105 its reverse (5012031212323), we get a palindrome (8244152514428).
The spelling of 3232121302105 in words is "three trillion, two hundred thirty-two billion, one hundred twenty-one million, three hundred two thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •