Base | Representation |
---|---|
bin | 11011010000001100… |
… | …11010010111111101 |
3 | 1101202200120210201021 |
4 | 31220012122113331 |
5 | 214431120210440 |
6 | 10415505544141 |
7 | 1025402650321 |
oct | 155006322775 |
9 | 41680523637 |
10 | 14631413245 |
11 | 6229062369 |
12 | 2a04045051 |
13 | 14c2385a97 |
14 | 9cb2b9981 |
15 | 5a97a884a |
hex | 36819a5fd |
14631413245 has 16 divisors (see below), whose sum is σ = 17932000320. Its totient is φ = 11457299584.
The previous prime is 14631413243. The next prime is 14631413249. The reversal of 14631413245 is 54231413641.
It is a cyclic number.
It is not a de Polignac number, because 14631413245 - 21 = 14631413243 is a prime.
It is a super-2 number, since 2×146314132452 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 14631413245.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14631413243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 37699 + ... + 175168.
It is an arithmetic number, because the mean of its divisors is an integer number (1120750020).
Almost surely, 214631413245 is an apocalyptic number.
It is an amenable number.
14631413245 is a deficient number, since it is larger than the sum of its proper divisors (3300587075).
14631413245 is a wasteful number, since it uses less digits than its factorization.
14631413245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 213164.
The product of its digits is 34560, while the sum is 34.
Adding to 14631413245 its reverse (54231413641), we get a palindrome (68862826886).
The spelling of 14631413245 in words is "fourteen billion, six hundred thirty-one million, four hundred thirteen thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •