Base | Representation |
---|---|
bin | 1101001110100110000… |
… | …1000011010011011011 |
3 | 210201120212100201222001 |
4 | 3103221201003103123 |
5 | 12210410022230003 |
6 | 252222221541431 |
7 | 22263421411135 |
oct | 3235141032333 |
9 | 721525321861 |
10 | 227256055003 |
11 | 8841913379a |
12 | 38063714877 |
13 | 18579082483 |
14 | addbd38055 |
15 | 5da123761d |
hex | 34e98434db |
227256055003 has 4 divisors (see below), whose sum is σ = 229267170648. Its totient is φ = 225244939360.
The previous prime is 227256055001. The next prime is 227256055021. The reversal of 227256055003 is 300550652722.
227256055003 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 227256055003 - 21 = 227256055001 is a prime.
It is a super-2 number, since 2×2272560550032 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (227256055001) 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, 1005557653 + ... + 1005557878.
It is an arithmetic number, because the mean of its divisors is an integer number (57316792662).
Almost surely, 2227256055003 is an apocalyptic number.
227256055003 is a deficient number, since it is larger than the sum of its proper divisors (2011115645).
227256055003 is a wasteful number, since it uses less digits than its factorization.
227256055003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2011115644.
The product of its (nonzero) digits is 126000, while the sum is 37.
The spelling of 227256055003 in words is "two hundred twenty-seven billion, two hundred fifty-six million, fifty-five thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •