Base | Representation |
---|---|
bin | 100000110001000001… |
… | …0001101001010100000 |
3 | 20201121210200211200110 |
4 | 1001202002031022200 |
5 | 2123101220101422 |
6 | 52154101251320 |
7 | 5040456006462 |
oct | 1014202151240 |
9 | 221553624613 |
10 | 70364222112 |
11 | 27928850588 |
12 | 11778a03b40 |
13 | 6834a400b2 |
14 | 3597146132 |
15 | 1c6c5a860c |
hex | 106208d2a0 |
70364222112 has 48 divisors (see below), whose sum is σ = 184722703200. Its totient is φ = 23452630272.
The previous prime is 70364222107. The next prime is 70364222129. The reversal of 70364222112 is 21122246307.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×703642221122 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 70364222112.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 1332403 + ... + 1384205.
It is an arithmetic number, because the mean of its divisors is an integer number (3848389650).
Almost surely, 270364222112 is an apocalyptic number.
It is an amenable number.
70364222112 is an abundant number, since it is smaller than the sum of its proper divisors (114358481088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
70364222112 is a wasteful number, since it uses less digits than its factorization.
70364222112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65965 (or 65957 counting only the distinct ones).
The product of its (nonzero) digits is 8064, while the sum is 30.
Adding to 70364222112 its reverse (21122246307), we get a palindrome (91486468419).
The spelling of 70364222112 in words is "seventy billion, three hundred sixty-four million, two hundred twenty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •