Base | Representation |
---|---|
bin | 10011001001111010… |
… | …10110010001011001 |
3 | 222112200200000202122 |
4 | 21210331112101121 |
5 | 132030114110301 |
6 | 4420240111025 |
7 | 512561222012 |
oct | 114475262131 |
9 | 28480600678 |
10 | 10283738201 |
11 | 43a79a17a0 |
12 | 1bb0005475 |
13 | c7b7134b9 |
14 | 6d7b02009 |
15 | 402c5881b |
hex | 264f56459 |
10283738201 has 8 divisors (see below), whose sum is σ = 11809077600. Its totient is φ = 8856807840.
The previous prime is 10283738191. The next prime is 10283738237.
10283738201 is nontrivially palindromic in base 10.
10283738201 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 a de Polignac number, because none of the positive numbers 2k-10283738201 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10283738251) 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, 24602036 + ... + 24602453.
It is an arithmetic number, because the mean of its divisors is an integer number (1476134700).
Almost surely, 210283738201 is an apocalyptic number.
10283738201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10283738201 is a deficient number, since it is larger than the sum of its proper divisors (1525339399).
10283738201 is a wasteful number, since it uses less digits than its factorization.
10283738201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49204519.
The product of its (nonzero) digits is 16128, while the sum is 35.
The spelling of 10283738201 in words is "ten billion, two hundred eighty-three million, seven hundred thirty-eight thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •