Base | Representation |
---|---|
bin | 100101011010000… |
… | …0100010010100001 |
3 | 10020110210220000001 |
4 | 1022310010102201 |
5 | 10032310204131 |
6 | 324314300001 |
7 | 43050465316 |
oct | 11264042241 |
9 | 3213726001 |
10 | 1255163041 |
11 | 594563630 |
12 | 2b0427601 |
13 | 170069932 |
14 | bc9acd0d |
15 | 752d5261 |
hex | 4ad044a1 |
1255163041 has 8 divisors (see below), whose sum is σ = 1369526400. Its totient is φ = 1140842640.
The previous prime is 1255163017. The next prime is 1255163093. The reversal of 1255163041 is 1403615521.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1255163041 - 27 = 1255162913 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1255163011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 100575 + ... + 112363.
It is an arithmetic number, because the mean of its divisors is an integer number (171190800).
Almost surely, 21255163041 is an apocalyptic number.
1255163041 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1255163041 is a deficient number, since it is larger than the sum of its proper divisors (114363359).
1255163041 is a wasteful number, since it uses less digits than its factorization.
1255163041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21479.
The product of its (nonzero) digits is 3600, while the sum is 28.
The square root of 1255163041 is about 35428.2802433310. The cubic root of 1255163041 is about 1078.6984323248.
Adding to 1255163041 its reverse (1403615521), we get a palindrome (2658778562).
The spelling of 1255163041 in words is "one billion, two hundred fifty-five million, one hundred sixty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •