Base | Representation |
---|---|
bin | 110100110110000000110001… |
… | …100010010100010111011111 |
3 | 1010110220012002120022101020102 |
4 | 310312000301202110113133 |
5 | 220430301341424313210 |
6 | 2142143420542011315 |
7 | 66645034653634004 |
oct | 6466006142242737 |
9 | 1113805076271212 |
10 | 232410101401055 |
11 | 6806463035a716 |
12 | 22096774876b3b |
13 | 9c8b2422a23c6 |
14 | 41569cd41d8ab |
15 | 1bd07c047bea5 |
hex | d360318945df |
232410101401055 has 16 divisors (see below), whose sum is σ = 281775569869920. Its totient is φ = 184005894868992.
The previous prime is 232410101401039. The next prime is 232410101401117. The reversal of 232410101401055 is 550104101014232.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 232410101401055 - 24 = 232410101401039 is a prime.
It is a super-2 number, since 2×2324101014010552 (a number of 30 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 9544631 + ... + 23577959.
It is an arithmetic number, because the mean of its divisors is an integer number (17610973116870).
Almost surely, 2232410101401055 is an apocalyptic number.
232410101401055 is a deficient number, since it is larger than the sum of its proper divisors (49365468468865).
232410101401055 is a wasteful number, since it uses less digits than its factorization.
232410101401055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14067578.
The product of its (nonzero) digits is 4800, while the sum is 29.
Adding to 232410101401055 its reverse (550104101014232), we get a palindrome (782514202415287).
The spelling of 232410101401055 in words is "two hundred thirty-two trillion, four hundred ten billion, one hundred one million, four hundred one thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •