Base | Representation |
---|---|
bin | 1011000111100010000100… |
… | …0111100010111010000111 |
3 | 1121021121100211211211221010 |
4 | 2301320201013202322013 |
5 | 3100234304313104120 |
6 | 41555350521053303 |
7 | 2401104631200351 |
oct | 261704107427207 |
9 | 47247324754833 |
10 | 12224032550535 |
11 | 3993201770a13 |
12 | 1455123927233 |
13 | 6a894b993c60 |
14 | 3039097700d1 |
15 | 162e961657e0 |
hex | b1e211e2e87 |
12224032550535 has 64 divisors (see below), whose sum is σ = 21462438606336. Its totient is φ = 5903867174400.
The previous prime is 12224032550473. The next prime is 12224032550581. The reversal of 12224032550535 is 53505523042221.
It is not a de Polignac number, because 12224032550535 - 216 = 12224032484999 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a junction number, because it is equal to n+sod(n) for n = 12224032550493 and 12224032550502.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 118708020 + ... + 118810950.
It is an arithmetic number, because the mean of its divisors is an integer number (335350603224).
Almost surely, 212224032550535 is an apocalyptic number.
12224032550535 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
12224032550535 is a deficient number, since it is larger than the sum of its proper divisors (9238406055801).
12224032550535 is a wasteful number, since it uses less digits than its factorization.
12224032550535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114496.
The product of its (nonzero) digits is 360000, while the sum is 39.
Adding to 12224032550535 its reverse (53505523042221), we get a palindrome (65729555592756).
The spelling of 12224032550535 in words is "twelve trillion, two hundred twenty-four billion, thirty-two million, five hundred fifty thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •