Base | Representation |
---|---|
bin | 1001010100001011101010… |
… | …0011111010101011101010 |
3 | 1100021011020201122220212000 |
4 | 2111002322203322223222 |
5 | 2320302243443324432 |
6 | 33441132401031430 |
7 | 2104661351426562 |
oct | 225027243725352 |
9 | 40234221586760 |
10 | 10242332011242 |
11 | 3299826448881 |
12 | 1195048325576 |
13 | 593b036cc656 |
14 | 275a353bdda2 |
15 | 12b65e99557c |
hex | 950ba8faaea |
10242332011242 has 64 divisors (see below), whose sum is σ = 23470689116160. Its totient is φ = 3309028476912.
The previous prime is 10242332011213. The next prime is 10242332011273. The reversal of 10242332011242 is 24211023324201.
10242332011242 is a `hidden beast` number, since 10 + 2 + 423 + 3 + 201 + 1 + 24 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 19328838 + ... + 19851665.
It is an arithmetic number, because the mean of its divisors is an integer number (366729517440).
Almost surely, 210242332011242 is an apocalyptic number.
10242332011242 is an abundant number, since it is smaller than the sum of its proper divisors (13228357104918).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10242332011242 is a wasteful number, since it uses less digits than its factorization.
10242332011242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39180664 (or 39180658 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 10242332011242 its reverse (24211023324201), we get a palindrome (34453355335443).
The spelling of 10242332011242 in words is "ten trillion, two hundred forty-two billion, three hundred thirty-two million, eleven thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •