Base | Representation |
---|---|
bin | 11101011010010011000… |
… | …10100010011000011011 |
3 | 10120121102001012002121121 |
4 | 32231021202202120123 |
5 | 113024102040330201 |
6 | 2052124001150111 |
7 | 133003253444155 |
oct | 16551142423033 |
9 | 3517361162547 |
10 | 1010551105051 |
11 | 35a632832324 |
12 | 143a2762b337 |
13 | 743aa1c2477 |
14 | 36ca7865ad5 |
15 | 1b447bd49a1 |
hex | eb498a261b |
1010551105051 has 4 divisors (see below), whose sum is σ = 1010882545000. Its totient is φ = 1010219665104.
The previous prime is 1010551105037. The next prime is 1010551105061. The reversal of 1010551105051 is 1505011550101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1010551105051 - 225 = 1010517550619 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1010551105001) 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 3 ways as a sum of consecutive naturals, for example, 165715401 + ... + 165721498.
It is an arithmetic number, because the mean of its divisors is an integer number (252720636250).
Almost surely, 21010551105051 is an apocalyptic number.
1010551105051 is a deficient number, since it is larger than the sum of its proper divisors (331439949).
1010551105051 is an equidigital number, since it uses as much as digits as its factorization.
1010551105051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 331439948.
The product of its (nonzero) digits is 625, while the sum is 25.
Adding to 1010551105051 its reverse (1505011550101), we get a palindrome (2515562655152).
The spelling of 1010551105051 in words is "one trillion, ten billion, five hundred fifty-one million, one hundred five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •