Base | Representation |
---|---|
bin | 110111010011001101111000… |
… | …001101111111101010100000 |
3 | 1011220010221121012112101211112 |
4 | 313103031320031333222200 |
5 | 223334300442240131102 |
6 | 2221134323001002452 |
7 | 102141366042652016 |
oct | 6723157015775240 |
9 | 1156127535471745 |
10 | 243213130005152 |
11 | 7054a12237551a |
12 | 23340401183428 |
13 | a592b90995308 |
14 | 440b814c048b6 |
15 | 1d1b7e9506252 |
hex | dd337837faa0 |
243213130005152 has 12 divisors (see below), whose sum is σ = 478825849697706. Its totient is φ = 121606565002560.
The previous prime is 243213130005143. The next prime is 243213130005191. The reversal of 243213130005152 is 251500031312342.
It can be written as a sum of positive squares in only one way, i.e., 202441789065616 + 40771340939536 = 14228204^2 + 6385244^2 .
It is a Harshad number since it is a multiple of its sum of digits (32), and also a Moran number because the ratio is a prime number: 7600410312661 = 243213130005152 / (2 + 4 + 3 + 2 + 1 + 3 + 1 + 3 + 0 + 0 + 0 + 5 + 1 + 5 + 2).
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3800205156299 + ... + 3800205156362.
Almost surely, 2243213130005152 is an apocalyptic number.
It is an amenable number.
243213130005152 is a deficient number, since it is larger than the sum of its proper divisors (235612719692554).
243213130005152 is an equidigital number, since it uses as much as digits as its factorization.
243213130005152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7600410312671 (or 7600410312663 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 32.
Adding to 243213130005152 its reverse (251500031312342), we get a palindrome (494713161317494).
The spelling of 243213130005152 in words is "two hundred forty-three trillion, two hundred thirteen billion, one hundred thirty million, five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •