Base | Representation |
---|---|
bin | 11010100011010101… |
… | …01011111100001101 |
3 | 1100210110101101110222 |
4 | 31101222223330031 |
5 | 213143242441123 |
6 | 10314303041125 |
7 | 1013152616036 |
oct | 152152537415 |
9 | 40713341428 |
10 | 14255046413 |
11 | 60556693a3 |
12 | 2919ba01a5 |
13 | 14623ca50a |
14 | 993307a8d |
15 | 5867126c8 |
hex | 351aabf0d |
14255046413 has 4 divisors (see below), whose sum is σ = 14255511228. Its totient is φ = 14254581600.
The previous prime is 14255046391. The next prime is 14255046433. The reversal of 14255046413 is 31464055241.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 31464055241 = 38971 ⋅807371.
It can be written as a sum of positive squares in 2 ways, for example, as 6941889124 + 7313157289 = 83318^2 + 85517^2 .
It is a cyclic number.
It is not a de Polignac number, because 14255046413 - 26 = 14255046349 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14255046433) 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 3 ways as a sum of consecutive naturals, for example, 182888 + ... + 248913.
It is an arithmetic number, because the mean of its divisors is an integer number (3563877807).
Almost surely, 214255046413 is an apocalyptic number.
It is an amenable number.
14255046413 is a deficient number, since it is larger than the sum of its proper divisors (464815).
14255046413 is an equidigital number, since it uses as much as digits as its factorization.
14255046413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 464814.
The product of its (nonzero) digits is 57600, while the sum is 35.
The spelling of 14255046413 in words is "fourteen billion, two hundred fifty-five million, forty-six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •