Base | Representation |
---|---|
bin | 11010001000100010… |
… | …11000101001111111 |
3 | 1100012210111121002200 |
4 | 31010101120221333 |
5 | 212213224410030 |
6 | 10240114122543 |
7 | 1004453444631 |
oct | 150421305177 |
9 | 40183447080 |
10 | 14030310015 |
11 | 5a4a820637 |
12 | 2876880453 |
13 | 1427991cb7 |
14 | 971526a51 |
15 | 571b1dd60 |
hex | 344458a7f |
14030310015 has 24 divisors (see below), whose sum is σ = 24381751680. Its totient is φ = 7463586624.
The previous prime is 14030309999. The next prime is 14030310023. The reversal of 14030310015 is 51001303041.
14030310015 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 14030310015 - 24 = 14030309999 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14030310015.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 383247 + ... + 418256.
It is an arithmetic number, because the mean of its divisors is an integer number (1015906320).
Almost surely, 214030310015 is an apocalyptic number.
14030310015 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
14030310015 is a deficient number, since it is larger than the sum of its proper divisors (10351441665).
14030310015 is a wasteful number, since it uses less digits than its factorization.
14030310015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 801903 (or 801900 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
Adding to 14030310015 its reverse (51001303041), we get a palindrome (65031613056).
The spelling of 14030310015 in words is "fourteen billion, thirty million, three hundred ten thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •