Base | Representation |
---|---|
bin | 10011001011011011… |
… | …10010100001100101 |
3 | 222120120120012000111 |
4 | 21211231302201211 |
5 | 132041341434322 |
6 | 4421412213021 |
7 | 513104161201 |
oct | 114555624145 |
9 | 28516505014 |
10 | 10296436837 |
11 | 4404085435 |
12 | 1bb430a171 |
13 | c8123b49b |
14 | 6d9689b01 |
15 | 403e16177 |
hex | 265b72865 |
10296436837 has 2 divisors, whose sum is σ = 10296436838. Its totient is φ = 10296436836.
The previous prime is 10296436831. The next prime is 10296436853. The reversal of 10296436837 is 73863469201.
10296436837 is digitally balanced in base 2 and base 3, because in such bases 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., 7286158881 + 3010277956 = 85359^2 + 54866^2 .
It is a cyclic number.
It is not a de Polignac number, because 10296436837 - 211 = 10296434789 is a prime.
It is a super-2 number, since 2×102964368372 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10296436831) 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, 5148218418 + 5148218419.
It is an arithmetic number, because the mean of its divisors is an integer number (5148218419).
Almost surely, 210296436837 is an apocalyptic number.
It is an amenable number.
10296436837 is a deficient number, since it is larger than the sum of its proper divisors (1).
10296436837 is an equidigital number, since it uses as much as digits as its factorization.
10296436837 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1306368, while the sum is 49.
The spelling of 10296436837 in words is "ten billion, two hundred ninety-six million, four hundred thirty-six thousand, eight hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •