Base | Representation |
---|---|
bin | 1001100000011001100011… |
… | …1000101010010010000011 |
3 | 1101000020000012201212210011 |
4 | 2120012120320222102003 |
5 | 2332222121411440001 |
6 | 34121403410045351 |
7 | 2126101523452360 |
oct | 230063070522203 |
9 | 41006005655704 |
10 | 10452220421251 |
11 | 336a841a36854 |
12 | 1209863579857 |
13 | 5aa842567cbb |
14 | 281c66897467 |
15 | 131d460d3d51 |
hex | 98198e2a483 |
10452220421251 has 8 divisors (see below), whose sum is σ = 11945417643360. Its totient is φ = 8959028918208.
The previous prime is 10452220421249. The next prime is 10452220421261. The reversal of 10452220421251 is 15212402225401.
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 10452220421251 - 21 = 10452220421249 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10452220421221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3726015 + ... + 5898103.
It is an arithmetic number, because the mean of its divisors is an integer number (1493177205420).
Almost surely, 210452220421251 is an apocalyptic number.
10452220421251 is a deficient number, since it is larger than the sum of its proper divisors (1493197222109).
10452220421251 is an equidigital number, since it uses as much as digits as its factorization.
10452220421251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2859533.
The product of its (nonzero) digits is 12800, while the sum is 31.
Adding to 10452220421251 its reverse (15212402225401), we get a palindrome (25664622646652).
The spelling of 10452220421251 in words is "ten trillion, four hundred fifty-two billion, two hundred twenty million, four hundred twenty-one thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •