Base | Representation |
---|---|
bin | 100100100001001001000001… |
… | …1100110110110010001100001 |
3 | 1120010022210001102120101022211 |
4 | 1021002102003212312101201 |
5 | 314100233211331213241 |
6 | 3055055435420402121 |
7 | 124441650603400450 |
oct | 11102220346662141 |
9 | 1503283042511284 |
10 | 321214222132321 |
11 | 933922063a1111 |
12 | 300395750a6341 |
13 | 10a304a961855b |
14 | 5946bcbd98b97 |
15 | 27207bbc90781 |
hex | 12424839b6461 |
321214222132321 has 16 divisors (see below), whose sum is σ = 370622051777664. Its totient is φ = 272687652618624.
The previous prime is 321214222132267. The next prime is 321214222132357. The reversal of 321214222132321 is 123231222412123.
It is a cyclic number.
It is not a de Polignac number, because 321214222132321 - 239 = 320664466318433 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (321214222138321) 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 15 ways as a sum of consecutive naturals, for example, 48521650 + ... + 54742843.
It is an arithmetic number, because the mean of its divisors is an integer number (23163878236104).
Almost surely, 2321214222132321 is an apocalyptic number.
It is an amenable number.
321214222132321 is a deficient number, since it is larger than the sum of its proper divisors (49407829645343).
321214222132321 is a wasteful number, since it uses less digits than its factorization.
321214222132321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103268760.
The product of its digits is 13824, while the sum is 31.
Adding to 321214222132321 its reverse (123231222412123), we get a palindrome (444445444544444).
The spelling of 321214222132321 in words is "three hundred twenty-one trillion, two hundred fourteen billion, two hundred twenty-two million, one hundred thirty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •