Base | Representation |
---|---|
bin | 1111011100111… |
… | …01010001111101 |
3 | 100000220022221021 |
4 | 13232131101331 |
5 | 231140302234 |
6 | 20510104141 |
7 | 3132513106 |
oct | 756352175 |
9 | 300808837 |
10 | 129619069 |
11 | 671917a8 |
12 | 374ab051 |
13 | 20b14298 |
14 | 133013ad |
15 | b5a59b4 |
hex | 7b9d47d |
129619069 has 4 divisors (see below), whose sum is σ = 129868380. Its totient is φ = 129369760.
The previous prime is 129619037. The next prime is 129619093. The reversal of 129619069 is 960916921.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 960916921 = 1063 ⋅903967.
It can be written as a sum of positive squares in 2 ways, for example, as 57198969 + 72420100 = 7563^2 + 8510^2 .
It is a cyclic number.
It is not a de Polignac number, because 129619069 - 25 = 129619037 is a prime.
It is a super-2 number, since 2×1296190692 = 33602206096853522, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (129619969) 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, 123874 + ... + 124915.
It is an arithmetic number, because the mean of its divisors is an integer number (32467095).
Almost surely, 2129619069 is an apocalyptic number.
It is an amenable number.
129619069 is a deficient number, since it is larger than the sum of its proper divisors (249311).
129619069 is an equidigital number, since it uses as much as digits as its factorization.
129619069 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 249310.
The product of its (nonzero) digits is 52488, while the sum is 43.
The square root of 129619069 is about 11385.0370662550. The cubic root of 129619069 is about 506.0844180526.
The spelling of 129619069 in words is "one hundred twenty-nine million, six hundred nineteen thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •