Base | Representation |
---|---|
bin | 10010110111001010… |
… | …11001011000010101 |
3 | 222010201201200211222 |
4 | 21123211121120111 |
5 | 131214333331113 |
6 | 4352501140125 |
7 | 505641346133 |
oct | 113345313025 |
9 | 28121650758 |
10 | 10126464533 |
11 | 4327141759 |
12 | 1b673ba645 |
13 | c54c68963 |
14 | 6c0c82753 |
15 | 3e403de08 |
hex | 25b959615 |
10126464533 has 2 divisors, whose sum is σ = 10126464534. Its totient is φ = 10126464532.
The previous prime is 10126464527. The next prime is 10126464559. The reversal of 10126464533 is 33546462101.
10126464533 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6931728049 + 3194736484 = 83257^2 + 56522^2 .
It is a cyclic number.
It is not a de Polignac number, because 10126464533 - 212 = 10126460437 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10126464493 and 10126464502.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10126464503) 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 as a sum of consecutive naturals, namely, 5063232266 + 5063232267.
It is an arithmetic number, because the mean of its divisors is an integer number (5063232267).
Almost surely, 210126464533 is an apocalyptic number.
It is an amenable number.
10126464533 is a deficient number, since it is larger than the sum of its proper divisors (1).
10126464533 is an equidigital number, since it uses as much as digits as its factorization.
10126464533 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51840, while the sum is 35.
The spelling of 10126464533 in words is "ten billion, one hundred twenty-six million, four hundred sixty-four thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •