Base | Representation |
---|---|
bin | 1001011100110110000101… |
… | …1001011101000001011001 |
3 | 1100210101101210200121221121 |
4 | 2113031201121131001121 |
5 | 2330222043421421244 |
6 | 34033344420205241 |
7 | 2121510426152104 |
oct | 227154131350131 |
9 | 40711353617847 |
10 | 10391159951449 |
11 | 3346958994072 |
12 | 11b9a62539821 |
13 | 5a4b611babb4 |
14 | 27cd1323573b |
15 | 130470707c84 |
hex | 9736165d059 |
10391159951449 has 4 divisors (see below), whose sum is σ = 10391279335936. Its totient is φ = 10391040566964.
The previous prime is 10391159951443. The next prime is 10391159951587. The reversal of 10391159951449 is 94415995119301.
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 10391159951449 - 27 = 10391159951321 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10391159951443) 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, 59561589 + ... + 59735794.
It is an arithmetic number, because the mean of its divisors is an integer number (2597819833984).
Almost surely, 210391159951449 is an apocalyptic number.
It is an amenable number.
10391159951449 is a deficient number, since it is larger than the sum of its proper divisors (119384487).
10391159951449 is an equidigital number, since it uses as much as digits as its factorization.
10391159951449 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119384486.
The product of its (nonzero) digits is 7873200, while the sum is 61.
The spelling of 10391159951449 in words is "ten trillion, three hundred ninety-one billion, one hundred fifty-nine million, nine hundred fifty-one thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •