Base | Representation |
---|---|
bin | 1100011001110010011… |
… | …11011001011100100010 |
3 | 1111201222222011202022120 |
4 | 12030321033121130202 |
5 | 23440234444200002 |
6 | 523435352445110 |
7 | 42534460040022 |
oct | 6147117313442 |
9 | 1451888152276 |
10 | 426162100002 |
11 | 154809439351 |
12 | 6a7149a9796 |
13 | 312578592a2 |
14 | 168aaa11a82 |
15 | b14361bcbc |
hex | 63393d9722 |
426162100002 has 8 divisors (see below), whose sum is σ = 852324200016. Its totient is φ = 142054033332.
The previous prime is 426162099947. The next prime is 426162100003. The reversal of 426162100002 is 200001261624.
426162100002 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
426162100002 is an admirable number.
It is a super-2 number, since 2×4261621000022 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (426162100003) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35513508328 + ... + 35513508339.
It is an arithmetic number, because the mean of its divisors is an integer number (106540525002).
Almost surely, 2426162100002 is an apocalyptic number.
426162100002 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
426162100002 is a wasteful number, since it uses less digits than its factorization.
426162100002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71027016672.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 426162100002 its reverse (200001261624), we get a palindrome (626163361626).
The spelling of 426162100002 in words is "four hundred twenty-six billion, one hundred sixty-two million, one hundred thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •