Base | Representation |
---|---|
bin | 1110100111110110100… |
… | …1001001001001011000 |
3 | 220000102200022010010122 |
4 | 3221331221021021120 |
5 | 13103442301244121 |
6 | 311223531332412 |
7 | 24102240053306 |
oct | 3517551111130 |
9 | 800380263118 |
10 | 251216040536 |
11 | 975a39a652a |
12 | 4082b8b1108 |
13 | 1a8c6cab4c6 |
14 | c232119276 |
15 | 68049725ab |
hex | 3a7da49258 |
251216040536 has 32 divisors (see below), whose sum is σ = 475966925280. Its totient is φ = 124291968000.
The previous prime is 251216040527. The next prime is 251216040539. The reversal of 251216040536 is 635040612152.
251216040536 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 251216040496 and 251216040505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (251216040539) 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 7 ways as a sum of consecutive naturals, for example, 5175821 + ... + 5224131.
It is an arithmetic number, because the mean of its divisors is an integer number (14873966415).
Almost surely, 2251216040536 is an apocalyptic number.
It is an amenable number.
251216040536 is a deficient number, since it is larger than the sum of its proper divisors (224750884744).
251216040536 is a wasteful number, since it uses less digits than its factorization.
251216040536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55115 (or 55111 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 35.
Adding to 251216040536 its reverse (635040612152), we get a palindrome (886256652688).
The spelling of 251216040536 in words is "two hundred fifty-one billion, two hundred sixteen million, forty thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •