Base | Representation |
---|---|
bin | 100000111101011100… |
… | …1001110110101010100 |
3 | 20202200212111121001120 |
4 | 1001322321032311110 |
5 | 2124430003100202 |
6 | 52303320523540 |
7 | 5054012060241 |
oct | 1017271166524 |
9 | 222625447046 |
10 | 70781300052 |
11 | 280222203a1 |
12 | 118746205b0 |
13 | 68a0280a88 |
14 | 35d66b45c8 |
15 | 1c93ee20bc |
hex | 107ae4ed54 |
70781300052 has 48 divisors (see below), whose sum is σ = 169669752000. Its totient is φ = 22952298240.
The previous prime is 70781300027. The next prime is 70781300053. The reversal of 70781300052 is 25000318707.
It is a super-3 number, since 3×707813000523 (a number of 34 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 70781299986 and 70781300022.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (70781300053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 34402 + ... + 377817.
It is an arithmetic number, because the mean of its divisors is an integer number (3534786500).
Almost surely, 270781300052 is an apocalyptic number.
It is an amenable number.
70781300052 is an abundant number, since it is smaller than the sum of its proper divisors (98888451948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
70781300052 is a wasteful number, since it uses less digits than its factorization.
70781300052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 412616 (or 412614 counting only the distinct ones).
The product of its (nonzero) digits is 11760, while the sum is 33.
Adding to 70781300052 its reverse (25000318707), we get a palindrome (95781618759).
The spelling of 70781300052 in words is "seventy billion, seven hundred eighty-one million, three hundred thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •