Base | Representation |
---|---|
bin | 1110110111100001001… |
… | …0010000111111001000 |
3 | 220102021201220111222002 |
4 | 3231320102100333020 |
5 | 13141100301441202 |
6 | 313201105050132 |
7 | 24311400510416 |
oct | 3557022207710 |
9 | 812251814862 |
10 | 255421124552 |
11 | 99361625380 |
12 | 41604026948 |
13 | 1b1172472b9 |
14 | c5107b62b6 |
15 | 699dc08302 |
hex | 3b78490fc8 |
255421124552 has 32 divisors (see below), whose sum is σ = 522475790400. Its totient is φ = 116095291200.
The previous prime is 255421124549. The next prime is 255421124593.
255421124552 is nontrivially palindromic in base 10.
255421124552 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 7 ways as a sum of consecutive naturals, for example, 2451602 + ... + 2553662.
It is an arithmetic number, because the mean of its divisors is an integer number (16327368450).
Almost surely, 2255421124552 is an apocalyptic number.
255421124552 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
255421124552 is an abundant number, since it is smaller than the sum of its proper divisors (267054665848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
255421124552 is a wasteful number, since it uses less digits than its factorization.
255421124552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130517 (or 130513 counting only the distinct ones).
The product of its digits is 160000, while the sum is 38.
It can be divided in two parts, 255421 and 124552, that added together give a palindrome (379973).
The spelling of 255421124552 in words is "two hundred fifty-five billion, four hundred twenty-one million, one hundred twenty-four thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •