Base | Representation |
---|---|
bin | 110101110000001001111000… |
… | …1001001110001110010010101 |
3 | 2022000002022102020222100221110 |
4 | 1223200103301021301302111 |
5 | 443433014342233411031 |
6 | 4353330251205205233 |
7 | 201406324636433460 |
oct | 15340236111616225 |
9 | 2260068366870843 |
10 | 472811225685141 |
11 | 12771a129810732 |
12 | 45041b96a00819 |
13 | 173a8ba436b115 |
14 | 84a8284b422d7 |
15 | 399dd896b2c46 |
hex | 1ae04f1271c95 |
472811225685141 has 8 divisors (see below), whose sum is σ = 720474248663104. Its totient is φ = 270177843248640.
The previous prime is 472811225685119. The next prime is 472811225685143. The reversal of 472811225685141 is 141586522118274.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 472811225685141 - 214 = 472811225668757 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (472811225685143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11257410135340 + ... + 11257410135381.
It is an arithmetic number, because the mean of its divisors is an integer number (90059281082888).
Almost surely, 2472811225685141 is an apocalyptic number.
It is an amenable number.
472811225685141 is a deficient number, since it is larger than the sum of its proper divisors (247663022977963).
472811225685141 is a wasteful number, since it uses less digits than its factorization.
472811225685141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22514820270731.
The product of its digits is 8601600, while the sum is 57.
The spelling of 472811225685141 in words is "four hundred seventy-two trillion, eight hundred eleven billion, two hundred twenty-five million, six hundred eighty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •