Base | Representation |
---|---|
bin | 110100110110101000101111… |
… | …010001100101010100000110 |
3 | 1010111001021212011022012110010 |
4 | 310312220233101211110012 |
5 | 220432002232330220200 |
6 | 2142215235013211050 |
7 | 66651114235425630 |
oct | 6466505721452406 |
9 | 1114037764265403 |
10 | 232453013132550 |
11 | 6808085096a721 |
12 | 220a2b4b930a86 |
13 | 9c922c06723c2 |
14 | 4158b005b7a50 |
15 | 1bd19828be150 |
hex | d36a2f465506 |
232453013132550 has 96 divisors (see below), whose sum is σ = 658864210563072. Its totient is φ = 53130024046080.
The previous prime is 232453013132477. The next prime is 232453013132573. The reversal of 232453013132550 is 55231310354232.
It is a junction number, because it is equal to n+sod(n) for n = 232453013132499 and 232453013132508.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 22381659 + ... + 31078041.
It is an arithmetic number, because the mean of its divisors is an integer number (6863168860032).
Almost surely, 2232453013132550 is an apocalyptic number.
232453013132550 is an abundant number, since it is smaller than the sum of its proper divisors (426411197430522).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
232453013132550 is a wasteful number, since it uses less digits than its factorization.
232453013132550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8721862 (or 8721857 counting only the distinct ones).
The product of its (nonzero) digits is 324000, while the sum is 39.
Adding to 232453013132550 its reverse (55231310354232), we get a palindrome (287684323486782).
The spelling of 232453013132550 in words is "two hundred thirty-two trillion, four hundred fifty-three billion, thirteen million, one hundred thirty-two thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •