Base | Representation |
---|---|
bin | 11101011011001111011100… |
… | …000010000000101000110001 |
3 | 121222012222122022222102121101 |
4 | 131123033130002000220301 |
5 | 113430320114341011233 |
6 | 1135124331435124401 |
7 | 36154644021142651 |
oct | 3533173402005061 |
9 | 558188568872541 |
10 | 129415351110193 |
11 | 38265818939a65 |
12 | 1262168b2a3701 |
13 | 5729a7a128345 |
14 | 23d5a44a18361 |
15 | ee65cc297c7d |
hex | 75b3dc080a31 |
129415351110193 has 4 divisors (see below), whose sum is σ = 129416899279860. Its totient is φ = 129413802940528.
The previous prime is 129415351110167. The next prime is 129415351110209. The reversal of 129415351110193 is 391011153514921.
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 89101385058609 + 40313966051584 = 9439353^2 + 6349328^2 .
It is a cyclic number.
It is not a de Polignac number, because 129415351110193 - 25 = 129415351110161 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (129415351110113) 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, 773959438 + ... + 774126631.
It is an arithmetic number, because the mean of its divisors is an integer number (32354224819965).
Almost surely, 2129415351110193 is an apocalyptic number.
It is an amenable number.
129415351110193 is a deficient number, since it is larger than the sum of its proper divisors (1548169667).
129415351110193 is an equidigital number, since it uses as much as digits as its factorization.
129415351110193 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1548169666.
The product of its (nonzero) digits is 145800, while the sum is 46.
The spelling of 129415351110193 in words is "one hundred twenty-nine trillion, four hundred fifteen billion, three hundred fifty-one million, one hundred ten thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •