Base | Representation |
---|---|
bin | 10011000000010101… |
… | …00101010010101001 |
3 | 222100002100102210210 |
4 | 21200022211102221 |
5 | 131344022242023 |
6 | 4404244331333 |
7 | 510563542020 |
oct | 114012452251 |
9 | 28302312723 |
10 | 10203321513 |
11 | 4366566520 |
12 | 1b890a3b49 |
13 | c67b68568 |
14 | 6cb16b8b7 |
15 | 3eab71593 |
hex | 2602a54a9 |
10203321513 has 32 divisors (see below), whose sum is σ = 17069460480. Its totient is φ = 5266647360.
The previous prime is 10203321503. The next prime is 10203321529. The reversal of 10203321513 is 31512330201.
It is not a de Polignac number, because 10203321513 - 24 = 10203321497 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 10203321513.
It is not an unprimeable number, because it can be changed into a prime (10203321503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 104403 + ... + 176936.
It is an arithmetic number, because the mean of its divisors is an integer number (533420640).
Almost surely, 210203321513 is an apocalyptic number.
It is an amenable number.
10203321513 is a deficient number, since it is larger than the sum of its proper divisors (6866138967).
10203321513 is a wasteful number, since it uses less digits than its factorization.
10203321513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 281517.
The product of its (nonzero) digits is 540, while the sum is 21.
Adding to 10203321513 its reverse (31512330201), we get a palindrome (41715651714).
The spelling of 10203321513 in words is "ten billion, two hundred three million, three hundred twenty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •