Base | Representation |
---|---|
bin | 111010000000001111001110… |
… | …011001000010010011000111 |
3 | 1020110020121112211122202121212 |
4 | 322000033032121002103013 |
5 | 231414102014033343211 |
6 | 2302320415432002035 |
7 | 104506405162501520 |
oct | 7200171631022307 |
9 | 1213217484582555 |
10 | 255103045215431 |
11 | 74313659557466 |
12 | 2474081983031b |
13 | ac4616343b76a |
14 | 46dd0a624b847 |
15 | 1e75c37b8138b |
hex | e803ce6424c7 |
255103045215431 has 16 divisors (see below), whose sum is σ = 304415914203648. Its totient is φ = 209019673500000.
The previous prime is 255103045215329. The next prime is 255103045215461. The reversal of 255103045215431 is 134512540301552.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-255103045215431 is a prime.
It is a super-2 number, since 2×2551030452154312 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (255103045215461) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 504040820 + ... + 504546681.
It is an arithmetic number, because the mean of its divisors is an integer number (19025994637728).
Almost surely, 2255103045215431 is an apocalyptic number.
255103045215431 is a deficient number, since it is larger than the sum of its proper divisors (49312868988217).
255103045215431 is a wasteful number, since it uses less digits than its factorization.
255103045215431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1008589102.
The product of its (nonzero) digits is 360000, while the sum is 41.
Adding to 255103045215431 its reverse (134512540301552), we get a palindrome (389615585516983).
The spelling of 255103045215431 in words is "two hundred fifty-five trillion, one hundred three billion, forty-five million, two hundred fifteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •