Base | Representation |
---|---|
bin | 1011011100100100… |
… | …00111110011111000 |
3 | 120212021022002121010 |
4 | 11232102013303320 |
5 | 100041133233030 |
6 | 2453441113520 |
7 | 305166302631 |
oct | 55622076370 |
9 | 16767262533 |
10 | 6145211640 |
11 | 26738a2507 |
12 | 12360288a0 |
13 | 76c1ac309 |
14 | 42420c888 |
15 | 25e76d6b0 |
hex | 16e487cf8 |
6145211640 has 64 divisors (see below), whose sum is σ = 18450380160. Its totient is φ = 1637412480.
The previous prime is 6145211627. The next prime is 6145211687. The reversal of 6145211640 is 461125416.
It is a super-2 number, since 2×61452116402 = 75527252200782979200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 6145211598 and 6145211607.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 135087 + ... + 174753.
It is an arithmetic number, because the mean of its divisors is an integer number (288287190).
Almost surely, 26145211640 is an apocalyptic number.
6145211640 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
6145211640 is an abundant number, since it is smaller than the sum of its proper divisors (12305168520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6145211640 is a wasteful number, since it uses less digits than its factorization.
6145211640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40972 (or 40968 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 30.
The square root of 6145211640 is about 78391.4002936547. The cubic root of 6145211640 is about 1831.6631778771.
The spelling of 6145211640 in words is "six billion, one hundred forty-five million, two hundred eleven thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •