Base | Representation |
---|---|
bin | 110100110010000101010110… |
… | …110101101101000000001010 |
3 | 1010102221101021210101202012210 |
4 | 310302011112311231000022 |
5 | 220411341003420100132 |
6 | 2141415413212245550 |
7 | 66616400116301166 |
oct | 6462052665550012 |
9 | 1112841253352183 |
10 | 232140144300042 |
11 | 67a7009a638060 |
12 | 220523947708b6 |
13 | 9c6b94c6a8b04 |
14 | 41479002d1ca6 |
15 | 1bc877056cbcc |
hex | d32156d6d00a |
232140144300042 has 32 divisors (see below), whose sum is σ = 506717079312384. Its totient is φ = 70313624418800.
The previous prime is 232140144300041. The next prime is 232140144300137. The reversal of 232140144300042 is 240003441041232.
It is a junction number, because it is equal to n+sod(n) for n = 232140144299982 and 232140144300009.
It is not an unprimeable number, because it can be changed into a prime (232140144300041) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 796699584 + ... + 796990907.
It is an arithmetic number, because the mean of its divisors is an integer number (15834908728512).
Almost surely, 2232140144300042 is an apocalyptic number.
232140144300042 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
232140144300042 is an abundant number, since it is smaller than the sum of its proper divisors (274576935012342).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
232140144300042 is a wasteful number, since it uses less digits than its factorization.
232140144300042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1593692714.
The product of its (nonzero) digits is 18432, while the sum is 30.
Adding to 232140144300042 its reverse (240003441041232), we get a palindrome (472143585341274).
The spelling of 232140144300042 in words is "two hundred thirty-two trillion, one hundred forty billion, one hundred forty-four million, three hundred thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •