Base | Representation |
---|---|
bin | 100100100001001000111111… |
… | …0010111001010000101111001 |
3 | 1120010022202211021222120002220 |
4 | 1021002101332113022011321 |
5 | 314100233021314224423 |
6 | 3055055422554314253 |
7 | 124441645454410134 |
oct | 11102217627120571 |
9 | 1503282737876086 |
10 | 321214134133113 |
11 | 93392170756aa1 |
12 | 3003954b728989 |
13 | 10a30494317210 |
14 | 5946bc040d21b |
15 | 27207b41ab9e3 |
hex | 124247e5ca179 |
321214134133113 has 32 divisors (see below), whose sum is σ = 481994961751296. Its totient is φ = 188796593027328.
The previous prime is 321214134133037. The next prime is 321214134133153. The reversal of 321214134133113 is 311331431412123.
It is a happy number.
It is not a de Polignac number, because 321214134133113 - 213 = 321214134124921 is a prime.
It is not an unprimeable number, because it can be changed into a prime (321214134133153) 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 31 ways as a sum of consecutive naturals, for example, 263867070 + ... + 265081607.
It is an arithmetic number, because the mean of its divisors is an integer number (15062342554728).
Almost surely, 2321214134133113 is an apocalyptic number.
It is an amenable number.
321214134133113 is a deficient number, since it is larger than the sum of its proper divisors (160780827618183).
321214134133113 is a wasteful number, since it uses less digits than its factorization.
321214134133113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 528949393.
The product of its digits is 15552, while the sum is 33.
Adding to 321214134133113 its reverse (311331431412123), we get a palindrome (632545565545236).
The spelling of 321214134133113 in words is "three hundred twenty-one trillion, two hundred fourteen billion, one hundred thirty-four million, one hundred thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •