Base | Representation |
---|---|
bin | 100101100001110010111111… |
… | …0111011111101000010011101 |
3 | 1121021210021220121111120100211 |
4 | 1023003211332323331002131 |
5 | 321231331140331130042 |
6 | 3130022013342452421 |
7 | 126346653260436136 |
oct | 11303457673750235 |
9 | 1537707817446324 |
10 | 330100431114397 |
11 | 961a8896733269 |
12 | 31033812594111 |
13 | 1122644c76a378 |
14 | 5b72d361c6c8d |
15 | 2826a0a630017 |
hex | 12c397eefd09d |
330100431114397 has 2 divisors, whose sum is σ = 330100431114398. Its totient is φ = 330100431114396.
The previous prime is 330100431114373. The next prime is 330100431114491. The reversal of 330100431114397 is 793411134001033.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 312583142560441 + 17517288553956 = 17680021^2 + 4185366^2 .
It is a cyclic number.
It is not a de Polignac number, because 330100431114397 - 231 = 330098283630749 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (330100431184397) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165050215557198 + 165050215557199.
It is an arithmetic number, because the mean of its divisors is an integer number (165050215557199).
Almost surely, 2330100431114397 is an apocalyptic number.
It is an amenable number.
330100431114397 is a deficient number, since it is larger than the sum of its proper divisors (1).
330100431114397 is an equidigital number, since it uses as much as digits as its factorization.
330100431114397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81648, while the sum is 40.
The spelling of 330100431114397 in words is "three hundred thirty trillion, one hundred billion, four hundred thirty-one million, one hundred fourteen thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •