Base | Representation |
---|---|
bin | 101101010100010000111… |
… | …0111010100010000100011 |
3 | 211001102020220012000212001 |
4 | 1122220201313110100203 |
5 | 1304020444301300402 |
6 | 21125121132544431 |
7 | 1211656232455312 |
oct | 132504167242043 |
9 | 24042226160761 |
10 | 6228270728227 |
11 | 1a91438501159 |
12 | 8470b7322117 |
13 | 3624286b9112 |
14 | 1776427b4279 |
15 | ac0292ee187 |
hex | 5aa21dd4423 |
6228270728227 has 8 divisors (see below), whose sum is σ = 6341901582464. Its totient is φ = 6115405065408.
The previous prime is 6228270728189. The next prime is 6228270728257. The reversal of 6228270728227 is 7228270728226.
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 6228270728227 - 227 = 6228136510499 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6228270728257) 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 7 ways as a sum of consecutive naturals, for example, 191281428 + ... + 191313985.
It is an arithmetic number, because the mean of its divisors is an integer number (792737697808).
Almost surely, 26228270728227 is an apocalyptic number.
6228270728227 is a deficient number, since it is larger than the sum of its proper divisors (113630854237).
6228270728227 is a wasteful number, since it uses less digits than its factorization.
6228270728227 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 382595709.
The product of its (nonzero) digits is 8429568, while the sum is 55.
Subtracting 6228270728227 from its reverse (7228270728226), we obtain a palindrome (999999999999).
The spelling of 6228270728227 in words is "six trillion, two hundred twenty-eight billion, two hundred seventy million, seven hundred twenty-eight thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •