Base | Representation |
---|---|
bin | 1101110000101110001… |
… | …01001100110010101001 |
3 | 1200012110120220201102211 |
4 | 12320113011030302221 |
5 | 30221330403013031 |
6 | 1001114453525121 |
7 | 46106154432364 |
oct | 6702705146251 |
9 | 1605416821384 |
10 | 472833641641 |
11 | 17258929a369 |
12 | 7777b0437a1 |
13 | 35784b6160a |
14 | 18c572790db |
15 | c475b8bbb1 |
hex | 6e1714cca9 |
472833641641 has 9 divisors (see below), whose sum is σ = 499043200413. Its totient is φ = 447935283180.
The previous prime is 472833641633. The next prime is 472833641671. The reversal of 472833641641 is 146146338274.
The square root of 472833641641 is 687629.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 472833641641 - 23 = 472833641633 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (472833641671) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 13046856 + ... + 13083046.
Almost surely, 2472833641641 is an apocalyptic number.
472833641641 is the 687629-th square number.
472833641641 is the 343815-th centered octagonal number.
It is an amenable number.
472833641641 is a deficient number, since it is larger than the sum of its proper divisors (26209558772).
472833641641 is an frugal number, since it uses more digits than its factorization.
472833641641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72420 (or 36210 counting only the distinct ones).
The product of its digits is 2322432, while the sum is 49.
Multiplying 472833641641 by its sum of digits (49), we get a square (23168848440409 = 48134032).
The spelling of 472833641641 in words is "four hundred seventy-two billion, eight hundred thirty-three million, six hundred forty-one thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •