Base | Representation |
---|---|
bin | 1010111110111001000000… |
… | …1011111111001011001111 |
3 | 1120202102011101101002202011 |
4 | 2233232100023333023033 |
5 | 3040321232431134021 |
6 | 41403235151042051 |
7 | 2354300635352431 |
oct | 257562013771317 |
9 | 46672141332664 |
10 | 12075572130511 |
11 | 393624872700a |
12 | 14303b0810327 |
13 | 69794c384386 |
14 | 2da664666651 |
15 | 15e1a77ecde1 |
hex | afb902ff2cf |
12075572130511 has 8 divisors (see below), whose sum is σ = 12870574739424. Its totient is φ = 11289977836800.
The previous prime is 12075572130493. The next prime is 12075572130541. The reversal of 12075572130511 is 11503127557021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12075572130511 - 27 = 12075572130383 is a prime.
It is a super-2 number, since 2×120755721305112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12075572130541) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2352076150 + ... + 2352081283.
It is an arithmetic number, because the mean of its divisors is an integer number (1608821842428).
Almost surely, 212075572130511 is an apocalyptic number.
12075572130511 is a deficient number, since it is larger than the sum of its proper divisors (795002608913).
12075572130511 is a wasteful number, since it uses less digits than its factorization.
12075572130511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4704157601.
The product of its (nonzero) digits is 73500, while the sum is 40.
Adding to 12075572130511 its reverse (11503127557021), we get a palindrome (23578699687532).
The spelling of 12075572130511 in words is "twelve trillion, seventy-five billion, five hundred seventy-two million, one hundred thirty thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •