Base | Representation |
---|---|
bin | 100100011111101010111010… |
… | …0010101010100000000111101 |
3 | 1120002121110100100122212111011 |
4 | 1020333111310111110000331 |
5 | 314033430241204230042 |
6 | 3054422531325355221 |
7 | 124421234103214012 |
oct | 11077256425240075 |
9 | 1502543310585434 |
10 | 321012102414397 |
11 | 93314517054519 |
12 | 30006367708b11 |
13 | 10a174080c6624 |
14 | 593b0d6577709 |
15 | 271a3dc6aba17 |
hex | 123f57455403d |
321012102414397 has 2 divisors, whose sum is σ = 321012102414398. Its totient is φ = 321012102414396.
The previous prime is 321012102414391. The next prime is 321012102414473. The reversal of 321012102414397 is 793414201210123.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 317669096079076 + 3343006335321 = 17823274^2 + 1828389^2 .
It is a cyclic number.
It is not a de Polignac number, because 321012102414397 - 227 = 321011968196669 is a prime.
It is a super-2 number, since 2×3210121024143972 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (321012102414391) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 160506051207198 + 160506051207199.
It is an arithmetic number, because the mean of its divisors is an integer number (160506051207199).
Almost surely, 2321012102414397 is an apocalyptic number.
It is an amenable number.
321012102414397 is a deficient number, since it is larger than the sum of its proper divisors (1).
321012102414397 is an equidigital number, since it uses as much as digits as its factorization.
321012102414397 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72576, while the sum is 40.
The spelling of 321012102414397 in words is "three hundred twenty-one trillion, twelve billion, one hundred two million, four hundred fourteen thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •