Base | Representation |
---|---|
bin | 1001011010100100101000… |
… | …0101100001100010101011 |
3 | 1100122122121122010011112201 |
4 | 2112221022011201202223 |
5 | 2324102112210123301 |
6 | 34003410125121031 |
7 | 2115626016243031 |
oct | 226511205414253 |
9 | 40578548104481 |
10 | 10352114145451 |
11 | 3331341613111 |
12 | 11b23860b9177 |
13 | 5a127aa28390 |
14 | 27b08b690551 |
15 | 12e4378a5201 |
hex | 96a4a1618ab |
10352114145451 has 8 divisors (see below), whose sum is σ = 11148859817424. Its totient is φ = 9555429787680.
The previous prime is 10352114145449. The next prime is 10352114145481. The reversal of 10352114145451 is 15454141125301.
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 10352114145451 - 21 = 10352114145449 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 10352114145451.
It is not an unprimeable number, because it can be changed into a prime (10352114145421) 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 7 ways as a sum of consecutive naturals, for example, 14977585 + ... + 15653506.
It is an arithmetic number, because the mean of its divisors is an integer number (1393607477178).
Almost surely, 210352114145451 is an apocalyptic number.
10352114145451 is a deficient number, since it is larger than the sum of its proper divisors (796745671973).
10352114145451 is a wasteful number, since it uses less digits than its factorization.
10352114145451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30657101.
The product of its (nonzero) digits is 48000, while the sum is 37.
The spelling of 10352114145451 in words is "ten trillion, three hundred fifty-two billion, one hundred fourteen million, one hundred forty-five thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •