Base | Representation |
---|---|
bin | 10011000111100101… |
… | …11011000110010001 |
3 | 222111022221211010112 |
4 | 21203302323012101 |
5 | 132010120300431 |
6 | 4414302011105 |
7 | 512233333451 |
oct | 114362730621 |
9 | 28438854115 |
10 | 10264228241 |
11 | 4397986663 |
12 | 1ba5576a95 |
13 | c77672147 |
14 | 6d52a3d61 |
15 | 4011a2c2b |
hex | 263cbb191 |
10264228241 has 8 divisors (see below), whose sum is σ = 10806861120. Its totient is φ = 9721836432.
The previous prime is 10264228237. The next prime is 10264228253. The reversal of 10264228241 is 14282246201.
10264228241 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10264228241 - 22 = 10264228237 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10264228198 and 10264228207.
It is not an unprimeable number, because it can be changed into a prime (10264228211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30671 + ... + 146523.
It is an arithmetic number, because the mean of its divisors is an integer number (1350857640).
Almost surely, 210264228241 is an apocalyptic number.
It is an amenable number.
10264228241 is a deficient number, since it is larger than the sum of its proper divisors (542632879).
10264228241 is a wasteful number, since it uses less digits than its factorization.
10264228241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120535.
The product of its (nonzero) digits is 12288, while the sum is 32.
The spelling of 10264228241 in words is "ten billion, two hundred sixty-four million, two hundred twenty-eight thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •