Base | Representation |
---|---|
bin | 10000000000011110111… |
… | …11010001010001111011 |
3 | 1221120200112111222012110 |
4 | 20000033133101101323 |
5 | 33002413002404441 |
6 | 1100401304343403 |
7 | 54510621023400 |
oct | 10001737212173 |
9 | 1846615458173 |
10 | 550015669371 |
11 | 1a2295563143 |
12 | 8a71b174b63 |
13 | 3cb352159cc |
14 | 1c899a722a7 |
15 | e491a70b16 |
hex | 800f7d147b |
550015669371 has 24 divisors (see below), whose sum is σ = 853114371600. Its totient is φ = 314284041792.
The previous prime is 550015669339. The next prime is 550015669381. The reversal of 550015669371 is 173966510055.
It is not a de Polignac number, because 550015669371 - 25 = 550015669339 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 550015669371.
It is not an unprimeable number, because it can be changed into a prime (550015669321) 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 23 ways as a sum of consecutive naturals, for example, 6891225 + ... + 6970581.
It is an arithmetic number, because the mean of its divisors is an integer number (35546432150).
Almost surely, 2550015669371 is an apocalyptic number.
550015669371 is a deficient number, since it is larger than the sum of its proper divisors (303098702229).
550015669371 is a wasteful number, since it uses less digits than its factorization.
550015669371 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126523 (or 126516 counting only the distinct ones).
The product of its (nonzero) digits is 850500, while the sum is 48.
The spelling of 550015669371 in words is "five hundred fifty billion, fifteen million, six hundred sixty-nine thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •