Base | Representation |
---|---|
bin | 101011101111100101000… |
… | …1100001001111010011001 |
3 | 210021202011012102200101221 |
4 | 1113133022030021322121 |
5 | 1242000140131243230 |
6 | 20441522011012041 |
7 | 1160233144662541 |
oct | 127371214117231 |
9 | 23252135380357 |
10 | 6012051431065 |
11 | 1a08773331a39 |
12 | 811213a3a021 |
13 | 347c1b0611b4 |
14 | 16adb0598321 |
15 | a65c1eb727a |
hex | 577ca309e99 |
6012051431065 has 16 divisors (see below), whose sum is σ = 7374487322880. Its totient is φ = 4703138697600.
The previous prime is 6012051431059. The next prime is 6012051431081. The reversal of 6012051431065 is 5601341502106.
6012051431065 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 6012051431065 - 217 = 6012051299993 is a prime.
It is a super-2 number, since 2×60120514310652 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 6012051431065.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11064711 + ... + 11595340.
It is an arithmetic number, because the mean of its divisors is an integer number (460905457680).
Almost surely, 26012051431065 is an apocalyptic number.
It is an amenable number.
6012051431065 is a deficient number, since it is larger than the sum of its proper divisors (1362435891815).
6012051431065 is a wasteful number, since it uses less digits than its factorization.
6012051431065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22661232.
The product of its (nonzero) digits is 21600, while the sum is 34.
The spelling of 6012051431065 in words is "six trillion, twelve billion, fifty-one million, four hundred thirty-one thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •