Base | Representation |
---|---|
bin | 111101110110100011111… |
… | …000011111101111001111 |
3 | 120001100012201020100212002 |
4 | 331312203320133233033 |
5 | 1024114431332331030 |
6 | 13012350121302515 |
7 | 616041443113265 |
oct | 75664370375717 |
9 | 16040181210762 |
10 | 4250472152015 |
11 | 13996847a16a1 |
12 | 58792a634a3b |
13 | 24aa8293c0cb |
14 | 109a1c738435 |
15 | 7587048b245 |
hex | 3dda3e1fbcf |
4250472152015 has 8 divisors (see below), whose sum is σ = 5110319102928. Its totient is φ = 3393876041280.
The previous prime is 4250472151997. The next prime is 4250472152021. The reversal of 4250472152015 is 5102512740524.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4250472152015 - 222 = 4250467957711 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4250472152015.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 812707166 + ... + 812712395.
It is an arithmetic number, because the mean of its divisors is an integer number (638789887866).
Almost surely, 24250472152015 is an apocalyptic number.
4250472152015 is a deficient number, since it is larger than the sum of its proper divisors (859846950913).
4250472152015 is a wasteful number, since it uses less digits than its factorization.
4250472152015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1625420089.
The product of its (nonzero) digits is 112000, while the sum is 38.
Adding to 4250472152015 its reverse (5102512740524), we get a palindrome (9352984892539).
The spelling of 4250472152015 in words is "four trillion, two hundred fifty billion, four hundred seventy-two million, one hundred fifty-two thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •