Base | Representation |
---|---|
bin | 101000111011110… |
… | …1001011100001101 |
3 | 10112201120011121202 |
4 | 1101313221130031 |
5 | 10303111322112 |
6 | 344143435245 |
7 | 46015626041 |
oct | 12167513415 |
9 | 3481504552 |
10 | 1373542157 |
11 | 645368609 |
12 | 323bb5b25 |
13 | 18b746b50 |
14 | d05c6021 |
15 | 808ba6c2 |
hex | 51de970d |
1373542157 has 16 divisors (see below), whose sum is σ = 1528584960. Its totient is φ = 1225979712.
The previous prime is 1373542151. The next prime is 1373542169. The reversal of 1373542157 is 7512453731.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1373542157 - 222 = 1369347853 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1373542157.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1373542151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 69644 + ... + 87162.
It is an arithmetic number, because the mean of its divisors is an integer number (95536560).
Almost surely, 21373542157 is an apocalyptic number.
It is an amenable number.
1373542157 is a deficient number, since it is larger than the sum of its proper divisors (155042803).
1373542157 is a wasteful number, since it uses less digits than its factorization.
1373542157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17732.
The product of its digits is 88200, while the sum is 38.
The square root of 1373542157 is about 37061.3296712355. The cubic root of 1373542157 is about 1111.5969106987.
Adding to 1373542157 its reverse (7512453731), we get a palindrome (8885995888).
The spelling of 1373542157 in words is "one billion, three hundred seventy-three million, five hundred forty-two thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •