Base | Representation |
---|---|
bin | 1000010110110… |
… | …10001000011001 |
3 | 11212220102102002 |
4 | 10023122020121 |
5 | 120421140411 |
6 | 10542250345 |
7 | 1510556444 |
oct | 413321031 |
9 | 155812362 |
10 | 70099481 |
11 | 36629861 |
12 | 1b5869b5 |
13 | 116a4baa |
14 | 944a65b |
15 | 624a33b |
hex | 42da219 |
70099481 has 4 divisors (see below), whose sum is σ = 70276452. Its totient is φ = 69922512.
The previous prime is 70099453. The next prime is 70099499. The reversal of 70099481 is 18499007.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 59043856 + 11055625 = 7684^2 + 3325^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-70099481 is a prime.
It is a super-3 number, since 3×700994813 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (70099441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 87890 + ... + 88683.
It is an arithmetic number, because the mean of its divisors is an integer number (17569113).
Almost surely, 270099481 is an apocalyptic number.
It is an amenable number.
70099481 is a deficient number, since it is larger than the sum of its proper divisors (176971).
70099481 is a wasteful number, since it uses less digits than its factorization.
70099481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 176970.
The product of its (nonzero) digits is 18144, while the sum is 38.
The square root of 70099481 is about 8372.5432814647. The cubic root of 70099481 is about 412.3236707029.
The spelling of 70099481 in words is "seventy million, ninety-nine thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •