Base | Representation |
---|---|
bin | 10000000001110111001… |
… | …111010011111000000011 |
3 | 10220022012021101221012110 |
4 | 100001313033103320003 |
5 | 121021344101130201 |
6 | 2202005551430403 |
7 | 142403332422654 |
oct | 20016717237003 |
9 | 3808167357173 |
10 | 1101512130051 |
11 | 39516a976753 |
12 | 159592225403 |
13 | 7cb45156798 |
14 | 3b45624752b |
15 | 1d9bd5e46d6 |
hex | 100773d3e03 |
1101512130051 has 8 divisors (see below), whose sum is σ = 1490603479744. Its totient is φ = 723381100200.
The previous prime is 1101512130031. The next prime is 1101512130119. The reversal of 1101512130051 is 1500312151011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1101512130051 - 26 = 1101512129987 is a prime.
It is a super-2 number, since 2×11015121300512 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1101512130031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2740079725 + ... + 2740080126.
It is an arithmetic number, because the mean of its divisors is an integer number (186325434968).
Almost surely, 21101512130051 is an apocalyptic number.
1101512130051 is a deficient number, since it is larger than the sum of its proper divisors (389091349693).
1101512130051 is an equidigital number, since it uses as much as digits as its factorization.
1101512130051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5480159921.
The product of its (nonzero) digits is 150, while the sum is 21.
Adding to 1101512130051 its reverse (1500312151011), we get a palindrome (2601824281062).
The spelling of 1101512130051 in words is "one trillion, one hundred one billion, five hundred twelve million, one hundred thirty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •