Base | Representation |
---|---|
bin | 111011000101001100010… |
… | …011011111110001101111 |
3 | 112101010122001221202101120 |
4 | 323011030103133301233 |
5 | 1013004412203232111 |
6 | 12345052134312023 |
7 | 566220120630435 |
oct | 73051423376157 |
9 | 15333561852346 |
10 | 4060024274031 |
11 | 1325934949110 |
12 | 556a39ab8613 |
13 | 235b215a454b |
14 | 100713110d55 |
15 | 70925905406 |
hex | 3b14c4dfc6f |
4060024274031 has 16 divisors (see below), whose sum is σ = 5915832244608. Its totient is φ = 2456311442400.
The previous prime is 4060024274027. The next prime is 4060024274087. The reversal of 4060024274031 is 1304724200604.
It is not a de Polignac number, because 4060024274031 - 22 = 4060024274027 is a prime.
It is a super-2 number, since 2×40600242740312 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 4060024273983 and 4060024274001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4060024274531) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 107714116 + ... + 107751801.
It is an arithmetic number, because the mean of its divisors is an integer number (369739515288).
Almost surely, 24060024274031 is an apocalyptic number.
4060024274031 is a deficient number, since it is larger than the sum of its proper divisors (1855807970577).
4060024274031 is a wasteful number, since it uses less digits than its factorization.
4060024274031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 215466502.
The product of its (nonzero) digits is 32256, while the sum is 33.
Adding to 4060024274031 its reverse (1304724200604), we get a palindrome (5364748474635).
The spelling of 4060024274031 in words is "four trillion, sixty billion, twenty-four million, two hundred seventy-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •