Base | Representation |
---|---|
bin | 100100100110000011010… |
… | …010010000001100110001 |
3 | 22220102000211201102211101 |
4 | 210212003102100030301 |
5 | 312200211131442101 |
6 | 5203133013244401 |
7 | 346454026202164 |
oct | 44460322201461 |
9 | 8812024642741 |
10 | 2514758468401 |
11 | 88a559661003 |
12 | 347463633701 |
13 | 1531aa19218a |
14 | 89a01bc3adb |
15 | 45634615401 |
hex | 24983490331 |
2514758468401 has 3 divisors (see below), whose sum is σ = 2514760054201. Its totient is φ = 2514756882602.
The previous prime is 2514758468363. The next prime is 2514758468419. The reversal of 2514758468401 is 1048648574152.
The square root of 2514758468401 is 1585799.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is not a de Polignac number, because 2514758468401 - 29 = 2514758467889 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2514758468471) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 792900 + ... + 2378698.
Almost surely, 22514758468401 is an apocalyptic number.
2514758468401 is the 1585799-th square number.
2514758468401 is the 792900-th centered octagonal number.
It is an amenable number.
2514758468401 is a deficient number, since it is larger than the sum of its proper divisors (1585800).
2514758468401 is an frugal number, since it uses more digits than its factorization.
2514758468401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3171598 (or 1585799 counting only the distinct ones).
The product of its (nonzero) digits is 8601600, while the sum is 55.
The spelling of 2514758468401 in words is "two trillion, five hundred fourteen billion, seven hundred fifty-eight million, four hundred sixty-eight thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •