Base | Representation |
---|---|
bin | 1101101000111101000… |
… | …1101001001100000000 |
3 | 211101212000000001002220 |
4 | 3122033101221030000 |
5 | 12314402443013044 |
6 | 255352312011040 |
7 | 22633652100312 |
oct | 3321721511400 |
9 | 741760001086 |
10 | 234332001024 |
11 | 9041a33a770 |
12 | 394b9390a80 |
13 | 19136029494 |
14 | b4ad9c37b2 |
15 | 6167554019 |
hex | 368f469300 |
234332001024 has 72 divisors (see below), whose sum is σ = 680361686592. Its totient is φ = 71009694720.
The previous prime is 234332001023. The next prime is 234332001053. The reversal of 234332001024 is 420100233432.
It is a super-2 number, since 2×2343320010242 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 234332000985 and 234332001003.
It is not an unprimeable number, because it can be changed into a prime (234332001023) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13860634 + ... + 13877529.
Almost surely, 2234332001024 is an apocalyptic number.
234332001024 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
234332001024 is an abundant number, since it is smaller than the sum of its proper divisors (446029685568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
234332001024 is a wasteful number, since it uses less digits than its factorization.
234332001024 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27738193 (or 27738179 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 24.
Adding to 234332001024 its reverse (420100233432), we get a palindrome (654432234456).
The spelling of 234332001024 in words is "two hundred thirty-four billion, three hundred thirty-two million, one thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •