Base | Representation |
---|---|
bin | 1000011001001… |
… | …00000000000010 |
3 | 11220110210110100 |
4 | 10030210000002 |
5 | 121010331200 |
6 | 10552543230 |
7 | 1513256535 |
oct | 414440002 |
9 | 156423410 |
10 | 70402050 |
11 | 36816114 |
12 | 1b6b1b16 |
13 | 1177c824 |
14 | 94c8a1c |
15 | 62a9d00 |
hex | 4324002 |
70402050 has 72 divisors (see below), whose sum is σ = 191142900. Its totient is φ = 18576000.
The previous prime is 70402039. The next prime is 70402061. The reversal of 70402050 is 5020407.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (70402039) and next prime (70402061).
It can be written as a sum of positive squares in 6 ways, for example, as 40030929 + 30371121 = 6327^2 + 5511^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 44676 + ... + 46224.
Almost surely, 270402050 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 70402050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (95571450).
70402050 is an abundant number, since it is smaller than the sum of its proper divisors (120740850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
70402050 is a wasteful number, since it uses less digits than its factorization.
70402050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1668 (or 1660 counting only the distinct ones).
The product of its (nonzero) digits is 280, while the sum is 18.
The square root of 70402050 is about 8390.5929468662. The cubic root of 70402050 is about 412.9160540494.
Adding to 70402050 its reverse (5020407), we get a palindrome (75422457).
The spelling of 70402050 in words is "seventy million, four hundred two thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.148 sec. • engine limits •