Base | Representation |
---|---|
bin | 1000111000001101011… |
… | …01100001101000011111 |
3 | 1002011101211022122002221 |
4 | 10130012231201220133 |
5 | 14444223122304201 |
6 | 352050201130211 |
7 | 31016361026125 |
oct | 4340655415037 |
9 | 1064354278087 |
10 | 305055275551 |
11 | 108411828684 |
12 | 4b156489967 |
13 | 229c7271c10 |
14 | 10a9c6b1915 |
15 | 7e063d34a1 |
hex | 4706b61a1f |
305055275551 has 4 divisors (see below), whose sum is σ = 328521065992. Its totient is φ = 281589485112.
The previous prime is 305055275533. The next prime is 305055275579. The reversal of 305055275551 is 155572550503.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 305055275551 - 29 = 305055275039 is a prime.
It is a super-2 number, since 2×3050552755512 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 305055275498 and 305055275507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (305055275051) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 11732895201 + ... + 11732895226.
It is an arithmetic number, because the mean of its divisors is an integer number (82130266498).
Almost surely, 2305055275551 is an apocalyptic number.
305055275551 is a deficient number, since it is larger than the sum of its proper divisors (23465790441).
305055275551 is a wasteful number, since it uses less digits than its factorization.
305055275551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23465790440.
The product of its (nonzero) digits is 656250, while the sum is 43.
The spelling of 305055275551 in words is "three hundred five billion, fifty-five million, two hundred seventy-five thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •