Base | Representation |
---|---|
bin | 1100010001110111001001… |
… | …0101011111111111111101 |
3 | 1202210200102221020100222101 |
4 | 3010131302111133333331 |
5 | 3232200022103400140 |
6 | 44414135102545101 |
7 | 2562262243225033 |
oct | 304356225377775 |
9 | 52720387210871 |
10 | 13501000450045 |
11 | 4335818869109 |
12 | 1620701898191 |
13 | 76c1a6170164 |
14 | 349648072553 |
15 | 1862d303999a |
hex | c477255fffd |
13501000450045 has 16 divisors (see below), whose sum is σ = 17130370199040. Its totient is φ = 10186452247104.
The previous prime is 13501000450039. The next prime is 13501000450061. The reversal of 13501000450045 is 54005400010531.
It is a cyclic number.
It is not a de Polignac number, because 13501000450045 - 25 = 13501000450013 is a prime.
13501000450045 is a modest number, since divided by 450045 gives 135010 as remainder.
It is a junction number, because it is equal to n+sod(n) for n = 13501000449995 and 13501000450022.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 318624094 + ... + 318666463.
It is an arithmetic number, because the mean of its divisors is an integer number (1070648137440).
Almost surely, 213501000450045 is an apocalyptic number.
It is an amenable number.
13501000450045 is a deficient number, since it is larger than the sum of its proper divisors (3629369748995).
13501000450045 is a wasteful number, since it uses less digits than its factorization.
13501000450045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 637290804.
The product of its (nonzero) digits is 6000, while the sum is 28.
Adding to 13501000450045 its reverse (54005400010531), we get a palindrome (67506400460576).
The spelling of 13501000450045 in words is "thirteen trillion, five hundred one billion, four hundred fifty thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •