Base | Representation |
---|---|
bin | 1001011111001110110000… |
… | …0000101111111111100010 |
3 | 1100221022011210021200012110 |
4 | 2113303230000233333202 |
5 | 2331410010343323432 |
6 | 34104243053340150 |
7 | 2124461105510655 |
oct | 227635400577742 |
9 | 40838153250173 |
10 | 10432140214242 |
11 | 336227820504a |
12 | 120599a797656 |
13 | 5a89923899c6 |
14 | 280cbda9389c |
15 | 13156d2c2dcc |
hex | 97cec02ffe2 |
10432140214242 has 8 divisors (see below), whose sum is σ = 20864280428496. Its totient is φ = 3477380071412.
The previous prime is 10432140214241. The next prime is 10432140214259. The reversal of 10432140214242 is 24241204123401.
It is a sphenic number, since it is the product of 3 distinct primes.
10432140214242 is an admirable number.
It is a super-4 number, since 4×104321402142424 (a number of 53 digits) contains 4444 as substring.
It is not an unprimeable number, because it can be changed into a prime (10432140214241) 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, 869345017848 + ... + 869345017859.
It is an arithmetic number, because the mean of its divisors is an integer number (2608035053562).
Almost surely, 210432140214242 is an apocalyptic number.
10432140214242 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.
10432140214242 is a wasteful number, since it uses less digits than its factorization.
10432140214242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1738690035712.
The product of its (nonzero) digits is 12288, while the sum is 30.
Adding to 10432140214242 its reverse (24241204123401), we get a palindrome (34673344337643).
The spelling of 10432140214242 in words is "ten trillion, four hundred thirty-two billion, one hundred forty million, two hundred fourteen thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •