Base | Representation |
---|---|
bin | 100000110000001001… |
… | …0110111010100100101 |
3 | 20201112202202222000202 |
4 | 1001200102313110211 |
5 | 2123021232102121 |
6 | 52151135520245 |
7 | 5036652634043 |
oct | 1014022672445 |
9 | 221482688022 |
10 | 70335034661 |
11 | 27913325621 |
12 | 1176b089085 |
13 | 682b990c08 |
14 | 3593309393 |
15 | 1c69c4040b |
hex | 10604b7525 |
70335034661 has 4 divisors (see below), whose sum is σ = 71325669024. Its totient is φ = 69344400300.
The previous prime is 70335034657. The next prime is 70335034703. The reversal of 70335034661 is 16643053307.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 70335034661 - 22 = 70335034657 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (70335034631) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 495317075 + ... + 495317216.
It is an arithmetic number, because the mean of its divisors is an integer number (17831417256).
Almost surely, 270335034661 is an apocalyptic number.
70335034661 is a gapful number since it is divisible by the number (71) formed by its first and last digit.
It is an amenable number.
70335034661 is a deficient number, since it is larger than the sum of its proper divisors (990634363).
70335034661 is an equidigital number, since it uses as much as digits as its factorization.
70335034661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 990634362.
The product of its (nonzero) digits is 136080, while the sum is 38.
Adding to 70335034661 its reverse (16643053307), we get a palindrome (86978087968).
The spelling of 70335034661 in words is "seventy billion, three hundred thirty-five million, thirty-four thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •