Base | Representation |
---|---|
bin | 101110001111000… |
… | …0011110111110101 |
3 | 11000010012110211122 |
4 | 1130132003313311 |
5 | 11134123242203 |
6 | 413535313325 |
7 | 53305355402 |
oct | 13436036765 |
9 | 4003173748 |
10 | 1551384053 |
11 | 72679688a |
12 | 37367b845 |
13 | 1b954363b |
14 | 10a07b2a9 |
15 | 912e9538 |
hex | 5c783df5 |
1551384053 has 4 divisors (see below), whose sum is σ = 1551463200. Its totient is φ = 1551304908.
The previous prime is 1551384049. The next prime is 1551384071. The reversal of 1551384053 is 3504831551.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 1551384053 - 22 = 1551384049 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1551384953) 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, 14048 + ... + 57446.
It is an arithmetic number, because the mean of its divisors is an integer number (387865800).
Almost surely, 21551384053 is an apocalyptic number.
It is an amenable number.
1551384053 is a deficient number, since it is larger than the sum of its proper divisors (79147).
1551384053 is an equidigital number, since it uses as much as digits as its factorization.
1551384053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79146.
The product of its (nonzero) digits is 36000, while the sum is 35.
The square root of 1551384053 is about 39387.6129385877. The cubic root of 1551384053 is about 1157.6388886484.
The spelling of 1551384053 in words is "one billion, five hundred fifty-one million, three hundred eighty-four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.397 sec. • engine limits •