Base | Representation |
---|---|
bin | 111110101001011011001101… |
… | …1001010000011111100001011 |
3 | 2200021002222110202001001200002 |
4 | 1331102312123022003330023 |
5 | 1034211410330222301110 |
6 | 5231553232201233215 |
7 | 224033064330422540 |
oct | 17522663312037413 |
9 | 2607088422031602 |
10 | 551051202150155 |
11 | 14a644558814023 |
12 | 519794b879280b |
13 | 1a862ba01ba265 |
14 | 9a1104032abc7 |
15 | 43a918de7baa5 |
hex | 1f52d9b283f0b |
551051202150155 has 8 divisors (see below), whose sum is σ = 755727362948832. Its totient is φ = 377863681474368.
The previous prime is 551051202150149. The next prime is 551051202150167.
551051202150155 is nontrivially palindromic in base 10.
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 551051202150155 - 222 = 551051197955851 is a prime.
It is a super-2 number, since 2×5510512021501552 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7872160030682 + ... + 7872160030751.
It is an arithmetic number, because the mean of its divisors is an integer number (94465920368604).
Almost surely, 2551051202150155 is an apocalyptic number.
551051202150155 is a deficient number, since it is larger than the sum of its proper divisors (204676160798677).
551051202150155 is a wasteful number, since it uses less digits than its factorization.
551051202150155 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15744320061445.
The product of its (nonzero) digits is 62500, while the sum is 38.
It can be divided in two parts, 55105120 and 2150155, that added together give a palindrome (57255275).
The spelling of 551051202150155 in words is "five hundred fifty-one trillion, fifty-one billion, two hundred two million, one hundred fifty thousand, one hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •