Base | Representation |
---|---|
bin | 1000011001110… |
… | …10111011000010 |
3 | 11220122120020200 |
4 | 10030322323002 |
5 | 121021332223 |
6 | 10554550030 |
7 | 1514130342 |
oct | 414727302 |
9 | 156576220 |
10 | 70495938 |
11 | 3687a707 |
12 | 1b738316 |
13 | 117b3496 |
14 | 9510d22 |
15 | 62c7a43 |
hex | 433aec2 |
70495938 has 18 divisors (see below), whose sum is σ = 152818419. Its totient is φ = 23486772.
The previous prime is 70495927. The next prime is 70495939. The reversal of 70495938 is 83959407.
70495938 is a `hidden beast` number, since 70 + 495 + 93 + 8 = 666.
It can be written as a sum of positive squares in only one way, i.e., 35247969 + 35247969 = 5937^2 + 5937^2 .
It is a tau number, because it is divible by the number of its divisors (18).
It is an ABA number since it can be written as A⋅BA, here for A=2, B=5937.
It is a junction number, because it is equal to n+sod(n) for n = 70495893 and 70495902.
It is not an unprimeable number, because it can be changed into a prime (70495939) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 34633 + ... + 36611.
Almost surely, 270495938 is an apocalyptic number.
70495938 is an abundant number, since it is smaller than the sum of its proper divisors (82322481).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
70495938 is an equidigital number, since it uses as much as digits as its factorization.
70495938 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3966 (or 1984 counting only the distinct ones).
The product of its (nonzero) digits is 272160, while the sum is 45.
The square root of 70495938 is about 8396.1859198091. The cubic root of 70495938 is about 413.0995271238.
The spelling of 70495938 in words is "seventy million, four hundred ninety-five thousand, nine hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •