Base | Representation |
---|---|
bin | 10101000111101001001… |
… | …101000110010111101010 |
3 | 12010202002202001022010200 |
4 | 111013221031012113222 |
5 | 142234244011112132 |
6 | 3030420421253030 |
7 | 206565655512006 |
oct | 25075115062752 |
9 | 5122082038120 |
10 | 1451316504042 |
11 | 50a555370309 |
12 | 1b5336b64176 |
13 | a6b2133c972 |
14 | 5035bb15706 |
15 | 27b433a4d7c |
hex | 151e93465ea |
1451316504042 has 24 divisors (see below), whose sum is σ = 3144543538500. Its totient is φ = 483768407040.
The previous prime is 1451316504007. The next prime is 1451316504047. The reversal of 1451316504042 is 2404056131541.
1451316504042 is a `hidden beast` number, since 1 + 4 + 513 + 1 + 65 + 0 + 40 + 42 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 1448631295281 + 2685208761 = 1203591^2 + 51819^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1451316503988 and 1451316504006.
It is not an unprimeable number, because it can be changed into a prime (1451316504047) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3030442 + ... + 3476522.
Almost surely, 21451316504042 is an apocalyptic number.
1451316504042 is an abundant number, since it is smaller than the sum of its proper divisors (1693227034458).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1451316504042 is a wasteful number, since it uses less digits than its factorization.
1451316504042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 626838 (or 626835 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 36.
The spelling of 1451316504042 in words is "one trillion, four hundred fifty-one billion, three hundred sixteen million, five hundred four thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •