Base | Representation |
---|---|
bin | 1011011011101101… |
… | …10110011010000101 |
3 | 120211202211212210000 |
4 | 11231312312122011 |
5 | 100032320444334 |
6 | 2453023551513 |
7 | 305051445600 |
oct | 55566663205 |
9 | 16752755700 |
10 | 6138062469 |
11 | 266a85a200 |
12 | 123375b599 |
13 | 76a878236 |
14 | 4232ab337 |
15 | 25dd0a299 |
hex | 16ddb6685 |
6138062469 has 90 divisors (see below), whose sum is σ = 11724941382. Its totient is φ = 3188354400.
The previous prime is 6138062459. The next prime is 6138062471. The reversal of 6138062469 is 9642608316.
6138062469 is a `hidden beast` number, since 6 + 13 + 8 + 0 + 624 + 6 + 9 = 666.
It can be written as a sum of positive squares in only one way, i.e., 5705838369 + 432224100 = 75537^2 + 20790^2 .
It is not a de Polignac number, because 6138062469 - 28 = 6138062213 is a prime.
It is a super-2 number, since 2×61380624692 = 75351621746692751922, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6138062429) 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 89 ways as a sum of consecutive naturals, for example, 473859 + ... + 486639.
Almost surely, 26138062469 is an apocalyptic number.
It is an amenable number.
6138062469 is a deficient number, since it is larger than the sum of its proper divisors (5586878913).
6138062469 is a wasteful number, since it uses less digits than its factorization.
6138062469 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12829 (or 12802 counting only the distinct ones).
The product of its (nonzero) digits is 373248, while the sum is 45.
The square root of 6138062469 is about 78345.7878191291. The cubic root of 6138062469 is about 1830.9525999834.
The spelling of 6138062469 in words is "six billion, one hundred thirty-eight million, sixty-two thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •