Base | Representation |
---|---|
bin | 1101000110011000101… |
… | …11000100111110001001 |
3 | 1121000210121100021121021 |
4 | 12203030113010332021 |
5 | 24333303412404041 |
6 | 542435300312441 |
7 | 44343012035554 |
oct | 6431427047611 |
9 | 1530717307537 |
10 | 450105200521 |
11 | 163985719129 |
12 | 732973a2721 |
13 | 335a21229a2 |
14 | 17adc87969b |
15 | ba9561dcd1 |
hex | 68cc5c4f89 |
450105200521 has 4 divisors (see below), whose sum is σ = 469674991872. Its totient is φ = 430535409172.
The previous prime is 450105200453. The next prime is 450105200527. The reversal of 450105200521 is 125002501054.
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 not a de Polignac number, because 450105200521 - 27 = 450105200393 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (450105200527) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9784895641 + ... + 9784895686.
It is an arithmetic number, because the mean of its divisors is an integer number (117418747968).
Almost surely, 2450105200521 is an apocalyptic number.
It is an amenable number.
450105200521 is a deficient number, since it is larger than the sum of its proper divisors (19569791351).
450105200521 is a wasteful number, since it uses less digits than its factorization.
450105200521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19569791350.
The product of its (nonzero) digits is 2000, while the sum is 25.
Adding to 450105200521 its reverse (125002501054), we get a palindrome (575107701575).
The spelling of 450105200521 in words is "four hundred fifty billion, one hundred five million, two hundred thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •