Base | Representation |
---|---|
bin | 1011010001111100… |
… | …10011111011110101 |
3 | 120122001200101202211 |
4 | 11220332103323311 |
5 | 44400332213331 |
6 | 2440535533421 |
7 | 303035163340 |
oct | 55076237365 |
9 | 16561611684 |
10 | 6056132341 |
11 | 262858a956 |
12 | 121022a271 |
13 | 7568c047c |
14 | 416461457 |
15 | 256a248b1 |
hex | 168f93ef5 |
6056132341 has 32 divisors (see below), whose sum is σ = 7208419328. Its totient is φ = 4980528000.
The previous prime is 6056132311. The next prime is 6056132353. The reversal of 6056132341 is 1432316506.
6056132341 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 6056132341 - 211 = 6056130293 is a prime.
It is a super-2 number, since 2×60561323412 = 73353477863412280562, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6056132311) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8063716 + ... + 8064466.
It is an arithmetic number, because the mean of its divisors is an integer number (225263104).
Almost surely, 26056132341 is an apocalyptic number.
It is an amenable number.
6056132341 is a deficient number, since it is larger than the sum of its proper divisors (1152286987).
6056132341 is a wasteful number, since it uses less digits than its factorization.
6056132341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1241.
The product of its (nonzero) digits is 12960, while the sum is 31.
The square root of 6056132341 is about 77821.1561273668. The cubic root of 6056132341 is about 1822.7696369903.
Adding to 6056132341 its reverse (1432316506), we get a palindrome (7488448847).
The spelling of 6056132341 in words is "six billion, fifty-six million, one hundred thirty-two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •