Base | Representation |
---|---|
bin | 111100010010101011… |
… | …1001110111110000001 |
3 | 110101012101200111121212 |
4 | 1320211113032332001 |
5 | 4110131310211442 |
6 | 135251433055505 |
7 | 12232350464225 |
oct | 1704527167601 |
9 | 411171614555 |
10 | 129475866497 |
11 | 4aa0182994a |
12 | 21115257595 |
13 | c29541ca73 |
14 | 63a3a30785 |
15 | 357bd2ea82 |
hex | 1e255cef81 |
129475866497 has 18 divisors (see below), whose sum is σ = 138103269318. Its totient is φ = 120967380352.
The previous prime is 129475866493. The next prime is 129475866521. The reversal of 129475866497 is 794668574921.
It can be written as a sum of positive squares in 3 ways, for example, as 110979594496 + 18496272001 = 333136^2 + 136001^2 .
It is not a de Polignac number, because 129475866497 - 22 = 129475866493 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (129475866493) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 292270358 + ... + 292270800.
It is an arithmetic number, because the mean of its divisors is an integer number (7672403851).
Almost surely, 2129475866497 is an apocalyptic number.
129475866497 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
129475866497 is a deficient number, since it is larger than the sum of its proper divisors (8627402821).
129475866497 is an frugal number, since it uses more digits than its factorization.
129475866497 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1297 (or 657 counting only the distinct ones).
The product of its digits is 182891520, while the sum is 68.
Multiplying 129475866497 by its sum of digits (68), we get a square (8804358921796 = 29672142).
The spelling of 129475866497 in words is "one hundred twenty-nine billion, four hundred seventy-five million, eight hundred sixty-six thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •