Base | Representation |
---|---|
bin | 10011001010000011… |
… | …01000101100100010 |
3 | 222112202210010122210 |
4 | 21211001220230202 |
5 | 132030411042432 |
6 | 4420320142550 |
7 | 512603613054 |
oct | 114501505442 |
9 | 28482703583 |
10 | 10284862242 |
11 | 43a859a256 |
12 | 1bb0467a56 |
13 | c7ba18005 |
14 | 6d7d158d4 |
15 | 402dcb8cc |
hex | 265068b22 |
10284862242 has 8 divisors (see below), whose sum is σ = 20569724496. Its totient is φ = 3428287412.
The previous prime is 10284862207. The next prime is 10284862243. The reversal of 10284862242 is 24226848201.
10284862242 is digitally balanced in base 5, 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.
10284862242 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 10284862242.
It is not an unprimeable number, because it can be changed into a prime (10284862243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 857071848 + ... + 857071859.
It is an arithmetic number, because the mean of its divisors is an integer number (2571215562).
Almost surely, 210284862242 is an apocalyptic number.
10284862242 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.
10284862242 is a wasteful number, since it uses less digits than its factorization.
10284862242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1714143712.
The product of its (nonzero) digits is 98304, while the sum is 39.
The spelling of 10284862242 in words is "ten billion, two hundred eighty-four million, eight hundred sixty-two thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •