Base | Representation |
---|---|
bin | 1000011010001… |
… | …11001001011110 |
3 | 11220202002221100 |
4 | 10031013021132 |
5 | 121024433024 |
6 | 11000013530 |
7 | 1514426340 |
oct | 415071136 |
9 | 156662840 |
10 | 70546014 |
11 | 369042a0 |
12 | 1b7612a6 |
13 | 11800206 |
14 | 9525290 |
15 | 62d77c9 |
hex | 434725e |
70546014 has 96 divisors (see below), whose sum is σ = 198941184. Its totient is φ = 17519040.
The previous prime is 70546001. The next prime is 70546033. The reversal of 70546014 is 41064507.
70546014 is a `hidden beast` number, since 7 + 0 + 54 + 601 + 4 = 666.
It is a hoax number, since the sum of its digits (27) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 30772 + ... + 32984.
It is an arithmetic number, because the mean of its divisors is an integer number (2072304).
Almost surely, 270546014 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 70546014, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (99470592).
70546014 is an abundant number, since it is smaller than the sum of its proper divisors (128395170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
70546014 is a wasteful number, since it uses less digits than its factorization.
70546014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2262 (or 2259 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 27.
The square root of 70546014 is about 8399.1674587426. The cubic root of 70546014 is about 413.1973175134.
The spelling of 70546014 in words is "seventy million, five hundred forty-six thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •