Base | Representation |
---|---|
bin | 1001010100001010111101… |
… | …0000011001010011010010 |
3 | 1100021010202111202211212020 |
4 | 2111002233100121103102 |
5 | 2320301401420010102 |
6 | 33441101503512310 |
7 | 2104653556330203 |
oct | 225025720312322 |
9 | 40233674684766 |
10 | 10242142344402 |
11 | 3299739383321 |
12 | 1194bb48b8696 |
13 | 593aa3322757 |
14 | 275a1812b5aa |
15 | 12b64ceccbbc |
hex | 950af4194d2 |
10242142344402 has 8 divisors (see below), whose sum is σ = 20484284688816. Its totient is φ = 3414047448132.
The previous prime is 10242142344389. The next prime is 10242142344403. The reversal of 10242142344402 is 20444324124201.
It is a sphenic number, since it is the product of 3 distinct primes.
10242142344402 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (10242142344403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 853511862028 + ... + 853511862039.
It is an arithmetic number, because the mean of its divisors is an integer number (2560535586102).
Almost surely, 210242142344402 is an apocalyptic number.
10242142344402 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.
10242142344402 is a wasteful number, since it uses less digits than its factorization.
10242142344402 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1707023724072.
The product of its (nonzero) digits is 49152, while the sum is 33.
Adding to 10242142344402 its reverse (20444324124201), we get a palindrome (30686466468603).
The spelling of 10242142344402 in words is "ten trillion, two hundred forty-two billion, one hundred forty-two million, three hundred forty-four thousand, four hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •