Base | Representation |
---|---|
bin | 1001011111111111111101… |
… | …1100110100111010001111 |
3 | 1100222120021111011111020221 |
4 | 2113333333130310322033 |
5 | 2332114034404242112 |
6 | 34114310023452211 |
7 | 2125436353426663 |
oct | 227777734647217 |
9 | 40876244144227 |
10 | 10445351243407 |
11 | 3367937515873 |
12 | 1208466bb7067 |
13 | 5a9cb93a7b22 |
14 | 2817b44728a3 |
15 | 131a9300be07 |
hex | 97fff734e8f |
10445351243407 has 8 divisors (see below), whose sum is σ = 10501216710912. Its totient is φ = 10389632213400.
The previous prime is 10445351243387. The next prime is 10445351243429. The reversal of 10445351243407 is 70434215354401.
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 10445351243407 - 215 = 10445351210639 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10445351243477) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36466333 + ... + 36751654.
It is an arithmetic number, because the mean of its divisors is an integer number (1312652088864).
Almost surely, 210445351243407 is an apocalyptic number.
10445351243407 is a deficient number, since it is larger than the sum of its proper divisors (55865467505).
10445351243407 is an equidigital number, since it uses as much as digits as its factorization.
10445351243407 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73218749.
The product of its (nonzero) digits is 806400, while the sum is 43.
Adding to 10445351243407 its reverse (70434215354401), we get a palindrome (80879566597808).
The spelling of 10445351243407 in words is "ten trillion, four hundred forty-five billion, three hundred fifty-one million, two hundred forty-three thousand, four hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •