Base | Representation |
---|---|
bin | 1010111100111000011010… |
… | …0000101110001101101011 |
3 | 1120122010001110222222200112 |
4 | 2233032012200232031223 |
5 | 3034240032303234111 |
6 | 41335325415124535 |
7 | 2351636305512500 |
oct | 257160640561553 |
9 | 46563043888615 |
10 | 12041050055531 |
11 | 3922642935132 |
12 | 142577737374b |
13 | 69460a186a83 |
14 | 2d8b0b8074a7 |
15 | 15d336bc4e8b |
hex | af38682e36b |
12041050055531 has 24 divisors (see below), whose sum is σ = 14306497980480. Its totient is φ = 10100217359232.
The previous prime is 12041050055519. The next prime is 12041050055539. The reversal of 12041050055531 is 13555005014021.
It is not a de Polignac number, because 12041050055531 - 222 = 12041045861227 is a prime.
It is a super-2 number, since 2×120410500555312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12041050055539) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 21447065 + ... + 22001333.
It is an arithmetic number, because the mean of its divisors is an integer number (596104082520).
Almost surely, 212041050055531 is an apocalyptic number.
12041050055531 is a deficient number, since it is larger than the sum of its proper divisors (2265447924949).
12041050055531 is an equidigital number, since it uses as much as digits as its factorization.
12041050055531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 563763 (or 563756 counting only the distinct ones).
The product of its (nonzero) digits is 15000, while the sum is 32.
Adding to 12041050055531 its reverse (13555005014021), we get a palindrome (25596055069552).
The spelling of 12041050055531 in words is "twelve trillion, forty-one billion, fifty million, fifty-five thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •