Base | Representation |
---|---|
bin | 1110101010001001000101… |
… | …11110110100111101000101 |
3 | 11020010120101221021122211110 |
4 | 13111010202332310331011 |
5 | 13211111340002423103 |
6 | 152320123542555233 |
7 | 6534565261023261 |
oct | 725044276647505 |
9 | 136116357248743 |
10 | 32234316451653 |
11 | a2a8551321088 |
12 | 3747287438b19 |
13 | 14ca8b5717384 |
14 | 7d62137330a1 |
15 | 3ad74dc88403 |
hex | 1d5122fb4f45 |
32234316451653 has 4 divisors (see below), whose sum is σ = 42979088602208. Its totient is φ = 21489544301100.
The previous prime is 32234316451627. The next prime is 32234316451691. The reversal of 32234316451653 is 35615461343223.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 32234316451653 - 28 = 32234316451397 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32234316451153) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5372386075273 + ... + 5372386075278.
It is an arithmetic number, because the mean of its divisors is an integer number (10744772150552).
Almost surely, 232234316451653 is an apocalyptic number.
It is an amenable number.
32234316451653 is a deficient number, since it is larger than the sum of its proper divisors (10744772150555).
32234316451653 is a wasteful number, since it uses less digits than its factorization.
32234316451653 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10744772150554.
The product of its digits is 4665600, while the sum is 48.
Adding to 32234316451653 its reverse (35615461343223), we get a palindrome (67849777794876).
The spelling of 32234316451653 in words is "thirty-two trillion, two hundred thirty-four billion, three hundred sixteen million, four hundred fifty-one thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •