Base | Representation |
---|---|
bin | 11110101010010111001101… |
… | …10010000001011010101100 |
3 | 22211201212222120201011211222 |
4 | 33111023212302001122230 |
5 | 32314202444213012132 |
6 | 355223111121002512 |
7 | 20126246534514113 |
oct | 1725134662013254 |
9 | 284655876634758 |
10 | 67426268485292 |
11 | 1a536357840622 |
12 | 768b7b4a83438 |
13 | 2b81367aa1072 |
14 | 129163d754c7a |
15 | 7bdda2dd5412 |
hex | 3d52e6c816ac |
67426268485292 has 12 divisors (see below), whose sum is σ = 117996049385760. Its totient is φ = 33713111517936.
The previous prime is 67426268485243. The next prime is 67426268485297. The reversal of 67426268485292 is 29258486262476.
67426268485292 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×674262684852922 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (67426268485297) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2213834 + ... + 11821742.
It is an arithmetic number, because the mean of its divisors is an integer number (9833004115480).
Almost surely, 267426268485292 is an apocalyptic number.
It is an amenable number.
67426268485292 is a deficient number, since it is larger than the sum of its proper divisors (50569780900468).
67426268485292 is a wasteful number, since it uses less digits than its factorization.
67426268485292 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11362360 (or 11362358 counting only the distinct ones).
The product of its digits is 1114767360, while the sum is 71.
The spelling of 67426268485292 in words is "sixty-seven trillion, four hundred twenty-six billion, two hundred sixty-eight million, four hundred eighty-five thousand, two hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •