Base | Representation |
---|---|
bin | 10011000001110111… |
… | …10101001001011001 |
3 | 222100222122022222221 |
4 | 21200323311021121 |
5 | 131410323402023 |
6 | 4405425144041 |
7 | 511111351345 |
oct | 114073651131 |
9 | 28328568887 |
10 | 10216231513 |
11 | 4372883a44 |
12 | 1b9148b021 |
13 | c6a738807 |
14 | 6ccb6c625 |
15 | 3ebd7185d |
hex | 260ef5259 |
10216231513 has 8 divisors (see below), whose sum is σ = 10288027008. Its totient is φ = 10144562784.
The previous prime is 10216231511. The next prime is 10216231537. The reversal of 10216231513 is 31513261201.
It is a happy number.
10216231513 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 10216231513 - 21 = 10216231511 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10216231511) 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, 133045 + ... + 195277.
It is an arithmetic number, because the mean of its divisors is an integer number (1286003376).
Almost surely, 210216231513 is an apocalyptic number.
It is an amenable number.
10216231513 is a deficient number, since it is larger than the sum of its proper divisors (71795495).
10216231513 is an equidigital number, since it uses as much as digits as its factorization.
10216231513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63383.
The product of its (nonzero) digits is 1080, while the sum is 25.
Adding to 10216231513 its reverse (31513261201), we get a palindrome (41729492714).
The spelling of 10216231513 in words is "ten billion, two hundred sixteen million, two hundred thirty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •