Base | Representation |
---|---|
bin | 100100011111101111100101… |
… | …0001010101110011100000101 |
3 | 1120002122102020100212122121211 |
4 | 1020333133022022232130011 |
5 | 314034111311344223323 |
6 | 3054431310503211421 |
7 | 124422040463623666 |
oct | 11077371212563405 |
9 | 1502572210778554 |
10 | 321022132414213 |
11 | 933187a379986a |
12 | 300082a6746b71 |
13 | 10a18346088969 |
14 | 593b7a86a936d |
15 | 271a7c7ee370d |
hex | 123f7ca2ae705 |
321022132414213 has 16 divisors (see below), whose sum is σ = 335587540893696. Its totient is φ = 306724691571120.
The previous prime is 321022132414189. The next prime is 321022132414223. The reversal of 321022132414213 is 312414231220123.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-321022132414213 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (321022132414223) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 36459445 + ... + 44399722.
It is an arithmetic number, because the mean of its divisors is an integer number (20974221305856).
Almost surely, 2321022132414213 is an apocalyptic number.
It is an amenable number.
321022132414213 is a deficient number, since it is larger than the sum of its proper divisors (14565408479483).
321022132414213 is a wasteful number, since it uses less digits than its factorization.
321022132414213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 80860824.
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 321022132414213 its reverse (312414231220123), we get a palindrome (633436363634336).
The spelling of 321022132414213 in words is "three hundred twenty-one trillion, twenty-two billion, one hundred thirty-two million, four hundred fourteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •