Base | Representation |
---|---|
bin | 1110111000011000111… |
… | …1101000100010111101 |
3 | 220102220001120122202021 |
4 | 3232012033220202331 |
5 | 13142040230100040 |
6 | 313240232400141 |
7 | 24320243220322 |
oct | 3560617504275 |
9 | 812801518667 |
10 | 255655315645 |
11 | 99471840634 |
12 | 4166a546051 |
13 | 1b153913102 |
14 | c533938b49 |
15 | 69b456824a |
hex | 3b863e88bd |
255655315645 has 16 divisors (see below), whose sum is σ = 309256833600. Its totient is φ = 202878582400.
The previous prime is 255655315633. The next prime is 255655315679. The reversal of 255655315645 is 546513556552.
It is a de Polignac number, because none of the positive numbers 2k-255655315645 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 255655315592 and 255655315601.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1518906 + ... + 1678804.
It is an arithmetic number, because the mean of its divisors is an integer number (19328552100).
Almost surely, 2255655315645 is an apocalyptic number.
It is an amenable number.
255655315645 is a deficient number, since it is larger than the sum of its proper divisors (53601517955).
255655315645 is a wasteful number, since it uses less digits than its factorization.
255655315645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162476.
The product of its digits is 13500000, while the sum is 52.
The spelling of 255655315645 in words is "two hundred fifty-five billion, six hundred fifty-five million, three hundred fifteen thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •