Base | Representation |
---|---|
bin | 111100000110110110100… |
… | …110110100010011001111 |
3 | 112121212121112122111122001 |
4 | 330012312212310103033 |
5 | 1020133304430403323 |
6 | 12441312112533131 |
7 | 604264212623056 |
oct | 74066646642317 |
9 | 15555545574561 |
10 | 4130527200463 |
11 | 1352823a16264 |
12 | 5686352511a7 |
13 | 23c678c89cb1 |
14 | 103cc084139d |
15 | 726a025b3ad |
hex | 3c1b69b44cf |
4130527200463 has 8 divisors (see below), whose sum is σ = 4135390681760. Its totient is φ = 4125665806560.
The previous prime is 4130527200461. The next prime is 4130527200467. The reversal of 4130527200463 is 3640027250314.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4130527200463 - 21 = 4130527200461 is a prime.
It is a super-2 number, since 2×41305272004632 (a number of 26 digits) 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 (4130527200461) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 3455893 + ... + 4494913.
It is an arithmetic number, because the mean of its divisors is an integer number (516923835220).
Almost surely, 24130527200463 is an apocalyptic number.
4130527200463 is a deficient number, since it is larger than the sum of its proper divisors (4863481297).
4130527200463 is a wasteful number, since it uses less digits than its factorization.
4130527200463 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1043697.
The product of its (nonzero) digits is 120960, while the sum is 37.
The spelling of 4130527200463 in words is "four trillion, one hundred thirty billion, five hundred twenty-seven million, two hundred thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •