Base | Representation |
---|---|
bin | 100100011111101011011000… |
… | …0100000101101010000001111 |
3 | 1120002121112221201102212122121 |
4 | 1020333112300200231100033 |
5 | 314033434323140044234 |
6 | 3054423215433153411 |
7 | 124421301112642225 |
oct | 11077266040552017 |
9 | 1502545851385577 |
10 | 321013112034319 |
11 | 93314994a48951 |
12 | 300065a985b867 |
13 | 10a17539321373 |
14 | 593b1906aab15 |
15 | 271a44b13d4b4 |
hex | 123f5b082d40f |
321013112034319 has 32 divisors (see below), whose sum is σ = 328058532547200. Its totient is φ = 314055305920512.
The previous prime is 321013112034311. The next prime is 321013112034367. The reversal of 321013112034319 is 913430211310123.
It is a cyclic number.
It is not a de Polignac number, because 321013112034319 - 23 = 321013112034311 is a prime.
It is a super-2 number, since 2×3210131120343192 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (321013112034311) 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, 30769007727 + ... + 30769018159.
It is an arithmetic number, because the mean of its divisors is an integer number (10251829142100).
Almost surely, 2321013112034319 is an apocalyptic number.
321013112034319 is a deficient number, since it is larger than the sum of its proper divisors (7045420512881).
321013112034319 is a wasteful number, since it uses less digits than its factorization.
321013112034319 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15859.
The product of its (nonzero) digits is 11664, while the sum is 34.
The spelling of 321013112034319 in words is "three hundred twenty-one trillion, thirteen billion, one hundred twelve million, thirty-four thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •