Base | Representation |
---|---|
bin | 10011100101011001… |
… | …00110110000101001 |
3 | 1000010202101020111112 |
4 | 21302230212300221 |
5 | 133013120332223 |
6 | 4455152240105 |
7 | 521360324456 |
oct | 116254466051 |
9 | 30122336445 |
10 | 10514230313 |
11 | 4506010944 |
12 | 2055240035 |
13 | cb73b5772 |
14 | 71a58082d |
15 | 4180d7778 |
hex | 272b26c29 |
10514230313 has 4 divisors (see below), whose sum is σ = 10514466048. Its totient is φ = 10513994580.
The previous prime is 10514230297. The next prime is 10514230357. The reversal of 10514230313 is 31303241501.
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, and also an emirpimes, since its reverse is a distinct semiprime: 31303241501 = 7 ⋅4471891643.
It is a cyclic number.
It is not a de Polignac number, because 10514230313 - 24 = 10514230297 is a prime.
It is a super-2 number, since 2×105142303132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10514230213) 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, 28253 + ... + 147738.
It is an arithmetic number, because the mean of its divisors is an integer number (2628616512).
Almost surely, 210514230313 is an apocalyptic number.
It is an amenable number.
10514230313 is a deficient number, since it is larger than the sum of its proper divisors (235735).
10514230313 is an equidigital number, since it uses as much as digits as its factorization.
10514230313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 235734.
The product of its (nonzero) digits is 1080, while the sum is 23.
Adding to 10514230313 its reverse (31303241501), we get a palindrome (41817471814).
The spelling of 10514230313 in words is "ten billion, five hundred fourteen million, two hundred thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •