Base | Representation |
---|---|
bin | 11101010100001100101… |
… | …010001011010111110101 |
3 | 21010120220121002022222101 |
4 | 131110030222023113311 |
5 | 231001300310420140 |
6 | 4141250013502101 |
7 | 265355322563251 |
oct | 35241452132765 |
9 | 7116817068871 |
10 | 2014552045045 |
11 | 7074041236a1 |
12 | 2865254a1931 |
13 | 117c8234b507 |
14 | 6d70d3c9261 |
15 | 3760a80999a |
hex | 1d50ca8b5f5 |
2014552045045 has 4 divisors (see below), whose sum is σ = 2417462454060. Its totient is φ = 1611641636032.
The previous prime is 2014552045031. The next prime is 2014552045087. The reversal of 2014552045045 is 5405402554102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 872404568676 + 1142147476369 = 934026^2 + 1068713^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2014552045045 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2014552044995 and 2014552045013.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 201455204500 + ... + 201455204509.
It is an arithmetic number, because the mean of its divisors is an integer number (604365613515).
Almost surely, 22014552045045 is an apocalyptic number.
It is an amenable number.
2014552045045 is a deficient number, since it is larger than the sum of its proper divisors (402910409015).
2014552045045 is an equidigital number, since it uses as much as digits as its factorization.
2014552045045 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 402910409014.
The product of its (nonzero) digits is 160000, while the sum is 37.
Adding to 2014552045045 its reverse (5405402554102), we get a palindrome (7419954599147).
The spelling of 2014552045045 in words is "two trillion, fourteen billion, five hundred fifty-two million, forty-five thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •