Base | Representation |
---|---|
bin | 10010111001001001… |
… | …00110001111111001 |
3 | 222011212220102120110 |
4 | 21130210212033321 |
5 | 131233104013223 |
6 | 4354252214533 |
7 | 506232231531 |
oct | 113444461771 |
9 | 28155812513 |
10 | 10143032313 |
11 | 4335528337 |
12 | 1b70a6a449 |
13 | c58519a8b |
14 | 6c31564c1 |
15 | 3e5712d93 |
hex | 25c9263f9 |
10143032313 has 4 divisors (see below), whose sum is σ = 13524043088. Its totient is φ = 6762021540.
The previous prime is 10143032309. The next prime is 10143032323. The reversal of 10143032313 is 31323034101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 10143032313 - 22 = 10143032309 is a prime.
It is a super-2 number, since 2×101430323132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10143032313.
It is not an unprimeable number, because it can be changed into a prime (10143032323) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1690505383 + ... + 1690505388.
It is an arithmetic number, because the mean of its divisors is an integer number (3381010772).
Almost surely, 210143032313 is an apocalyptic number.
It is an amenable number.
10143032313 is a deficient number, since it is larger than the sum of its proper divisors (3381010775).
10143032313 is an equidigital number, since it uses as much as digits as its factorization.
10143032313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3381010774.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 10143032313 its reverse (31323034101), we get a palindrome (41466066414).
The spelling of 10143032313 in words is "ten billion, one hundred forty-three million, thirty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •