Base | Representation |
---|---|
bin | 1001011010100000011110… |
… | …1100010111011100100001 |
3 | 1100122112202000010122001201 |
4 | 2112220013230113130201 |
5 | 2324042322031113431 |
6 | 34003103414401201 |
7 | 2115556302312553 |
oct | 226500754273441 |
9 | 40575660118051 |
10 | 10351000254241 |
11 | 333091a880169 |
12 | 11b2115060201 |
13 | 5a113102295a |
14 | 27adc37774d3 |
15 | 12e3bebc8461 |
hex | 96a07b17721 |
10351000254241 has 4 divisors (see below), whose sum is σ = 10351155283092. Its totient is φ = 10350845225392.
The previous prime is 10351000254233. The next prime is 10351000254247. The reversal of 10351000254241 is 14245200015301.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6370177214241 + 3980823040000 = 2523921^2 + 1995200^2 .
It is a cyclic number.
It is not a de Polignac number, because 10351000254241 - 23 = 10351000254233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10351000254247) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 77414230 + ... + 77547823.
It is an arithmetic number, because the mean of its divisors is an integer number (2587788820773).
Almost surely, 210351000254241 is an apocalyptic number.
It is an amenable number.
10351000254241 is a deficient number, since it is larger than the sum of its proper divisors (155028851).
10351000254241 is an equidigital number, since it uses as much as digits as its factorization.
10351000254241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155028850.
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 10351000254241 its reverse (14245200015301), we get a palindrome (24596200269542).
The spelling of 10351000254241 in words is "ten trillion, three hundred fifty-one billion, two hundred fifty-four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •