Base | Representation |
---|---|
bin | 10101110011100001111001… |
… | …01111110101001100101001 |
3 | 20021202222102022120212210211 |
4 | 22321300330233311030221 |
5 | 22241103132210023134 |
6 | 245551535212541121 |
7 | 13046163354443536 |
oct | 1271607457651451 |
9 | 207688368525724 |
10 | 47950034064169 |
11 | 1430754a1a1166 |
12 | 54650554817a1 |
13 | 209a8904b7a03 |
14 | bbab18b73d8d |
15 | 5824552ba764 |
hex | 2b9c3cbf5329 |
47950034064169 has 4 divisors (see below), whose sum is σ = 48970247554944. Its totient is φ = 46929820573396.
The previous prime is 47950034064133. The next prime is 47950034064203. The reversal of 47950034064169 is 96146043005974.
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 47950034064169 - 211 = 47950034062121 is a prime.
It is a super-2 number, since 2×479500340641692 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (47950034064109) 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, 510106745317 + ... + 510106745410.
It is an arithmetic number, because the mean of its divisors is an integer number (12242561888736).
Almost surely, 247950034064169 is an apocalyptic number.
It is an amenable number.
47950034064169 is a deficient number, since it is larger than the sum of its proper divisors (1020213490775).
47950034064169 is a wasteful number, since it uses less digits than its factorization.
47950034064169 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1020213490774.
The product of its (nonzero) digits is 19595520, while the sum is 58.
The spelling of 47950034064169 in words is "forty-seven trillion, nine hundred fifty billion, thirty-four million, sixty-four thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •