Base | Representation |
---|---|
bin | 10010010011111000000… |
… | …10011001110100100001 |
3 | 2020010221021121221200001 |
4 | 21021330002121310201 |
5 | 40301442413330144 |
6 | 1201005323100001 |
7 | 63311554501441 |
oct | 11117402316441 |
9 | 2203837557601 |
10 | 629146230049 |
11 | 222901710627 |
12 | a1b23971601 |
13 | 4743619438c |
14 | 22645168121 |
15 | 11573a4cbd4 |
hex | 927c099d21 |
629146230049 has 4 divisors (see below), whose sum is σ = 649441269760. Its totient is φ = 608851190340.
The previous prime is 629146230019. The next prime is 629146230059. The reversal of 629146230049 is 940032641926.
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 629146230049 - 211 = 629146228001 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 629146229990 and 629146230008.
It is not an unprimeable number, because it can be changed into a prime (629146230019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10147519809 + ... + 10147519870.
It is an arithmetic number, because the mean of its divisors is an integer number (162360317440).
Almost surely, 2629146230049 is an apocalyptic number.
It is an amenable number.
629146230049 is a deficient number, since it is larger than the sum of its proper divisors (20295039711).
629146230049 is a wasteful number, since it uses less digits than its factorization.
629146230049 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20295039710.
The product of its (nonzero) digits is 559872, while the sum is 46.
The spelling of 629146230049 in words is "six hundred twenty-nine billion, one hundred forty-six million, two hundred thirty thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •