Base | Representation |
---|---|
bin | 1101101010001011011… |
… | …1001110101101011000 |
3 | 211102200220100200011110 |
4 | 3122202313032231120 |
5 | 12321041104334034 |
6 | 255445051300320 |
7 | 22645052240415 |
oct | 3324267165530 |
9 | 742626320143 |
10 | 234660621144 |
11 | 90578891944 |
12 | 3958b44a6a0 |
13 | 19189138161 |
14 | b5014c710c |
15 | 6186317de9 |
hex | 36a2dceb58 |
234660621144 has 64 divisors (see below), whose sum is σ = 601870963680. Its totient is φ = 76196736000.
The previous prime is 234660621127. The next prime is 234660621149. The reversal of 234660621144 is 441126066432.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (234660621149) 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, 470034 + ... + 830814.
Almost surely, 2234660621144 is an apocalyptic number.
234660621144 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 234660621144, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (300935481840).
234660621144 is an abundant number, since it is smaller than the sum of its proper divisors (367210342536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
234660621144 is a wasteful number, since it uses less digits than its factorization.
234660621144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 361492 (or 361488 counting only the distinct ones).
The product of its (nonzero) digits is 165888, while the sum is 39.
Adding to 234660621144 its reverse (441126066432), we get a palindrome (675786687576).
The spelling of 234660621144 in words is "two hundred thirty-four billion, six hundred sixty million, six hundred twenty-one thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •