Base | Representation |
---|---|
bin | 11110100111001000100010… |
… | …01100111011000010100100 |
3 | 22211100021120202200110022221 |
4 | 33103210101030323002210 |
5 | 32310343224110433221 |
6 | 355100121005402124 |
7 | 20115241105641100 |
oct | 1723442114730244 |
9 | 284307522613287 |
10 | 67315311030436 |
11 | 1a4a3299196507 |
12 | 76721a9569344 |
13 | 2b73a64112131 |
14 | 128a11533a900 |
15 | 7bb05bc12541 |
hex | 3d391133b0a4 |
67315311030436 has 18 divisors (see below), whose sum is σ = 137034740312358. Its totient is φ = 28849419012960.
The previous prime is 67315311030377. The next prime is 67315311030449. The reversal of 67315311030436 is 63403011351376.
It can be written as a sum of positive squares in only one way, i.e., 55510039656036 + 11805271374400 = 7450506^2 + 3435880^2 .
It is a super-2 number, since 2×673153110304362 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 67315311030392 and 67315311030401.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 171722732025 + ... + 171722732416.
Almost surely, 267315311030436 is an apocalyptic number.
It is an amenable number.
67315311030436 is an abundant number, since it is smaller than the sum of its proper divisors (69719429281922).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
67315311030436 is a wasteful number, since it uses less digits than its factorization.
67315311030436 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 343445464459 (or 343445464450 counting only the distinct ones).
The product of its (nonzero) digits is 408240, while the sum is 43.
The spelling of 67315311030436 in words is "sixty-seven trillion, three hundred fifteen billion, three hundred eleven million, thirty thousand, four hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •