Base | Representation |
---|---|
bin | 1101000110011011001… |
… | …11111111011000110001 |
3 | 1121000212002020220100011 |
4 | 12203031213333120301 |
5 | 24333324330130223 |
6 | 542441335054521 |
7 | 44343360236605 |
oct | 6431547773061 |
9 | 1530762226304 |
10 | 450126411313 |
11 | 163996696107 |
12 | 732a2511441 |
13 | 335a663b257 |
14 | 17b015db505 |
15 | ba9740d80d |
hex | 68cd9ff631 |
450126411313 has 4 divisors (see below), whose sum is σ = 450127908928. Its totient is φ = 450124913700.
The previous prime is 450126411253. The next prime is 450126411347. The reversal of 450126411313 is 313114621054.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-450126411313 is a prime.
It is a super-2 number, since 2×4501264113132 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (450126411013) 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 3 ways as a sum of consecutive naturals, for example, 124413 + ... + 956938.
It is an arithmetic number, because the mean of its divisors is an integer number (112531977232).
Almost surely, 2450126411313 is an apocalyptic number.
It is an amenable number.
450126411313 is a deficient number, since it is larger than the sum of its proper divisors (1497615).
450126411313 is a wasteful number, since it uses less digits than its factorization.
450126411313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1497614.
The product of its (nonzero) digits is 8640, while the sum is 31.
The spelling of 450126411313 in words is "four hundred fifty billion, one hundred twenty-six million, four hundred eleven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •