Base | Representation |
---|---|
bin | 10000000001011000101… |
… | …111111110110111011011 |
3 | 10220020212121212120022221 |
4 | 100001120233332313123 |
5 | 121014322123213201 |
6 | 2201443115524511 |
7 | 142354551460531 |
oct | 20013057766733 |
9 | 3806777776287 |
10 | 1101000601051 |
11 | 394a2815540a |
12 | 15946aa59737 |
13 | 7ca93195bc0 |
14 | 3b408330151 |
15 | 1d98d7504a1 |
hex | 10058bfeddb |
1101000601051 has 32 divisors (see below), whose sum is σ = 1240279326720. Its totient is φ = 970412227200.
The previous prime is 1101000601031. The next prime is 1101000601061. The reversal of 1101000601051 is 1501060001011.
It is not a de Polignac number, because 1101000601051 - 213 = 1101000592859 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1101000601031) 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 31 ways as a sum of consecutive naturals, for example, 50004921 + ... + 50026933.
It is an arithmetic number, because the mean of its divisors is an integer number (38758728960).
Almost surely, 21101000601051 is an apocalyptic number.
1101000601051 is a deficient number, since it is larger than the sum of its proper divisors (139278725669).
1101000601051 is a wasteful number, since it uses less digits than its factorization.
1101000601051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23707.
The product of its (nonzero) digits is 30, while the sum is 16.
Adding to 1101000601051 its reverse (1501060001011), we get a palindrome (2602060602062).
The spelling of 1101000601051 in words is "one trillion, one hundred one billion, six hundred one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •