Base | Representation |
---|---|
bin | 10011100100000101… |
… | …00101010011111111 |
3 | 1000002222122120102100 |
4 | 21302002211103333 |
5 | 133002310324320 |
6 | 4454120200143 |
7 | 521164564065 |
oct | 116202452377 |
9 | 30088576370 |
10 | 10503214335 |
11 | 44aa877429 |
12 | 2051609053 |
13 | cb5029633 |
14 | 718d14035 |
15 | 41715d790 |
hex | 2720a54ff |
10503214335 has 12 divisors (see below), whose sum is σ = 18205571592. Its totient is φ = 5601714288.
The previous prime is 10503214313. The next prime is 10503214367. The reversal of 10503214335 is 53341230501.
10503214335 is a `hidden beast` number, since 1 + 0 + 5 + 0 + 321 + 4 + 335 = 666.
It is not a de Polignac number, because 10503214335 - 213 = 10503206143 is a prime.
It is a super-2 number, since 2×105032143352 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10503214299 and 10503214308.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 116702337 + ... + 116702426.
It is an arithmetic number, because the mean of its divisors is an integer number (1517130966).
Almost surely, 210503214335 is an apocalyptic number.
10503214335 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10503214335 is a deficient number, since it is larger than the sum of its proper divisors (7702357257).
10503214335 is a wasteful number, since it uses less digits than its factorization.
10503214335 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 233404774 (or 233404771 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 27.
Adding to 10503214335 its reverse (53341230501), we get a palindrome (63844444836).
The spelling of 10503214335 in words is "ten billion, five hundred three million, two hundred fourteen thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •