Base | Representation |
---|---|
bin | 1011011110000011… |
… | …01100001010111010 |
3 | 120220010202121210210 |
4 | 11233001230022322 |
5 | 100102331300323 |
6 | 2455004251550 |
7 | 305410266504 |
oct | 55701541272 |
9 | 16803677723 |
10 | 6157681338 |
11 | 267a93a146 |
12 | 123a240bb6 |
13 | 771957033 |
14 | 425b36d74 |
15 | 2608d3293 |
hex | 16f06c2ba |
6157681338 has 8 divisors (see below), whose sum is σ = 12315362688. Its totient is φ = 2052560444.
The previous prime is 6157681337. The next prime is 6157681339. The reversal of 6157681338 is 8331867516.
It is an interprime number because it is at equal distance from previous prime (6157681337) and next prime (6157681339).
It is a sphenic number, since it is the product of 3 distinct primes.
6157681338 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (6157681337) 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 3 ways as a sum of consecutive naturals, for example, 513140106 + ... + 513140117.
It is an arithmetic number, because the mean of its divisors is an integer number (1539420336).
Almost surely, 26157681338 is an apocalyptic number.
6157681338 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6157681338 is a wasteful number, since it uses less digits than its factorization.
6157681338 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1026280228.
The product of its digits is 725760, while the sum is 48.
The square root of 6157681338 is about 78470.8948464333. The cubic root of 6157681338 is about 1832.9012613601.
The spelling of 6157681338 in words is "six billion, one hundred fifty-seven million, six hundred eighty-one thousand, three hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.162 sec. • engine limits •