Base | Representation |
---|---|
bin | 11101100011101111111011… |
… | …110100100001111111100101 |
3 | 122001021212201112000021201211 |
4 | 131203233323310201333211 |
5 | 114014404444444444343 |
6 | 1140253101525551421 |
7 | 36245122121541415 |
oct | 3543577364417745 |
9 | 561255645007654 |
10 | 129999999999973 |
11 | 384707659a8204 |
12 | 126b6a54b75571 |
13 | 576cc4158517c |
14 | 241606819c645 |
15 | 10068e959879d |
hex | 763bfbd21fe5 |
129999999999973 has 2 divisors, whose sum is σ = 129999999999974. Its totient is φ = 129999999999972.
The previous prime is 129999999999953. The next prime is 130000000000063. The reversal of 129999999999973 is 379999999999921.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 112493323926369 + 17506676073604 = 10606287^2 + 4184098^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-129999999999973 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (129999999999953) 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 as a sum of consecutive naturals, namely, 64999999999986 + 64999999999987.
It is an arithmetic number, because the mean of its divisors is an integer number (64999999999987).
Almost surely, 2129999999999973 is an apocalyptic number.
It is an amenable number.
129999999999973 is a deficient number, since it is larger than the sum of its proper divisors (1).
129999999999973 is an equidigital number, since it uses as much as digits as its factorization.
129999999999973 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1318004503578, while the sum is 112.
The spelling of 129999999999973 in words is "one hundred twenty-nine trillion, nine hundred ninety-nine billion, nine hundred ninety-nine million, nine hundred ninety-nine thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •