Base | Representation |
---|---|
bin | 100001110001001010001… |
… | …1000110110110010100101 |
3 | 121102200101001022101201121 |
4 | 1003202110120312302211 |
5 | 1102014334340123100 |
6 | 13512023150453541 |
7 | 656206436000656 |
oct | 103422430666245 |
9 | 17380331271647 |
10 | 4641054223525 |
11 | 152a295131a15 |
12 | 62b5738042b1 |
13 | 27885a04c2a5 |
14 | 1208b1bb552d |
15 | 80ad015251a |
hex | 43894636ca5 |
4641054223525 has 12 divisors (see below), whose sum is σ = 5755272584292. Its totient is φ = 3712607671040.
The previous prime is 4641054223511. The next prime is 4641054223549. The reversal of 4641054223525 is 5253224501464.
It can be written as a sum of positive squares in 6 ways, for example, as 144983508289 + 4496070715236 = 380767^2 + 2120394^2 .
It is not a de Polignac number, because 4641054223525 - 27 = 4641054223397 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 5490484 + ... + 6279133.
It is an arithmetic number, because the mean of its divisors is an integer number (479606048691).
Almost surely, 24641054223525 is an apocalyptic number.
It is an amenable number.
4641054223525 is a deficient number, since it is larger than the sum of its proper divisors (1114218360767).
4641054223525 is a wasteful number, since it uses less digits than its factorization.
4641054223525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11785400 (or 11785395 counting only the distinct ones).
The product of its (nonzero) digits is 1152000, while the sum is 43.
Adding to 4641054223525 its reverse (5253224501464), we get a palindrome (9894278724989).
The spelling of 4641054223525 in words is "four trillion, six hundred forty-one billion, fifty-four million, two hundred twenty-three thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •