Base | Representation |
---|---|
bin | 1001101110010000010… |
… | …00001100100101100001 |
3 | 1011221021220210002121111 |
4 | 10313020020030211201 |
5 | 20433133414324242 |
6 | 413245241023321 |
7 | 33064365526303 |
oct | 4671010144541 |
9 | 1157256702544 |
10 | 334070073697 |
11 | 1197509359a8 |
12 | 548b3484b41 |
13 | 2566c4ab629 |
14 | 12251d41973 |
15 | 8a537a0817 |
hex | 4dc820c961 |
334070073697 has 2 divisors, whose sum is σ = 334070073698. Its totient is φ = 334070073696.
The previous prime is 334070073691. The next prime is 334070073703. The reversal of 334070073697 is 796370070433.
It is a balanced prime because it is at equal distance from previous prime (334070073691) and next prime (334070073703).
It can be written as a sum of positive squares in only one way, i.e., 329798666961 + 4271406736 = 574281^2 + 65356^2 .
It is a cyclic number.
It is not a de Polignac number, because 334070073697 - 215 = 334070040929 is a prime.
It is a super-2 number, since 2×3340700736972 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 334070073697.
It is not a weakly prime, because it can be changed into another prime (334070073691) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 167035036848 + 167035036849.
It is an arithmetic number, because the mean of its divisors is an integer number (167035036849).
Almost surely, 2334070073697 is an apocalyptic number.
It is an amenable number.
334070073697 is a deficient number, since it is larger than the sum of its proper divisors (1).
334070073697 is an equidigital number, since it uses as much as digits as its factorization.
334070073697 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2000376, while the sum is 49.
The spelling of 334070073697 in words is "three hundred thirty-four billion, seventy million, seventy-three thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •