Base | Representation |
---|---|
bin | 10010001101000110101… |
… | …110010100010110101111 |
3 | 11102121002212122210112201 |
4 | 102031012232110112233 |
5 | 130444043114432010 |
6 | 2354413411442331 |
7 | 156245330542564 |
oct | 22150656242657 |
9 | 4377085583481 |
10 | 1251022030255 |
11 | 44261235a648 |
12 | 1825588b63a7 |
13 | 90c8100915a |
14 | 4479a89c86b |
15 | 2281e16423a |
hex | 12346b945af |
1251022030255 has 8 divisors (see below), whose sum is σ = 1566497151072. Its totient is φ = 957303814368.
The previous prime is 1251022030189. The next prime is 1251022030259. The reversal of 1251022030255 is 5520302201521.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1251022030255 is a prime.
It is a super-3 number, since 3×12510220302553 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1251022030259) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5439226104 + ... + 5439226333.
It is an arithmetic number, because the mean of its divisors is an integer number (195812143884).
Almost surely, 21251022030255 is an apocalyptic number.
1251022030255 is a deficient number, since it is larger than the sum of its proper divisors (315475120817).
1251022030255 is a wasteful number, since it uses less digits than its factorization.
1251022030255 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10878452465.
The product of its (nonzero) digits is 6000, while the sum is 28.
Adding to 1251022030255 its reverse (5520302201521), we get a palindrome (6771324231776).
The spelling of 1251022030255 in words is "one trillion, two hundred fifty-one billion, twenty-two million, thirty thousand, two hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •