Base | Representation |
---|---|
bin | 110101010110001011111001… |
… | …001100101100101111001100 |
3 | 1010202201112222101012021211120 |
4 | 311112023321030230233030 |
5 | 221223012414434221202 |
6 | 2150555232355320540 |
7 | 100263545460026046 |
oct | 6526137114545714 |
9 | 1122645871167746 |
10 | 234621064367052 |
11 | 68837264305280 |
12 | 223931738b0150 |
13 | a0bb8961b476c |
14 | 41d1a11d80a96 |
15 | 1c1d0740a50bc |
hex | d562f932cbcc |
234621064367052 has 48 divisors (see below), whose sum is σ = 597229358081664. Its totient is φ = 71095851360000.
The previous prime is 234621064366979. The next prime is 234621064367059. The reversal of 234621064367052 is 250763460126432.
It is a junction number, because it is equal to n+sod(n) for n = 234621064366986 and 234621064367004.
It is not an unprimeable number, because it can be changed into a prime (234621064367059) 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, 11463949 + ... + 24508452.
It is an arithmetic number, because the mean of its divisors is an integer number (12442278293368).
Almost surely, 2234621064367052 is an apocalyptic number.
234621064367052 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
234621064367052 is an abundant number, since it is smaller than the sum of its proper divisors (362608293714612).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
234621064367052 is a wasteful number, since it uses less digits than its factorization.
234621064367052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36021830 (or 36021828 counting only the distinct ones).
The product of its (nonzero) digits is 8709120, while the sum is 51.
The spelling of 234621064367052 in words is "two hundred thirty-four trillion, six hundred twenty-one billion, sixty-four million, three hundred sixty-seven thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •