Base | Representation |
---|---|
bin | 100000001111100101011… |
… | …0011010010100011100100 |
3 | 120200122111210220011211202 |
4 | 1000133022303102203210 |
5 | 1040101220003201111 |
6 | 13231450450422032 |
7 | 635111020103630 |
oct | 100371263224344 |
9 | 16618453804752 |
10 | 4431513725156 |
11 | 1459437a72121 |
12 | 5b6a34b91918 |
13 | 261b752b840b |
14 | 1146b49c3dc0 |
15 | 7a419338b3b |
hex | 407cacd28e4 |
4431513725156 has 12 divisors (see below), whose sum is σ = 8863027450368. Its totient is φ = 1899220167912.
The previous prime is 4431513725153. The next prime is 4431513725203. The reversal of 4431513725156 is 6515273151344.
4431513725156 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 4431513725156.
It is not an unprimeable number, because it can be changed into a prime (4431513725153) 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 3 ways as a sum of consecutive naturals, for example, 79134173636 + ... + 79134173691.
It is an arithmetic number, because the mean of its divisors is an integer number (738585620864).
Almost surely, 24431513725156 is an apocalyptic number.
It is an amenable number.
4431513725156 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4431513725156 is a wasteful number, since it uses less digits than its factorization.
4431513725156 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158268347338 (or 158268347336 counting only the distinct ones).
The product of its digits is 1512000, while the sum is 47.
The spelling of 4431513725156 in words is "four trillion, four hundred thirty-one billion, five hundred thirteen million, seven hundred twenty-five thousand, one hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •