Base | Representation |
---|---|
bin | 10100101011101111000… |
… | …100011001110010011110 |
3 | 12000212202100000002101210 |
4 | 110223233010121302132 |
5 | 141241411112212020 |
6 | 3004543105445250 |
7 | 204455244435462 |
oct | 24535704316236 |
9 | 5025670002353 |
10 | 1421350116510 |
11 | 4a88780a4885 |
12 | 1ab573340826 |
13 | a4056c15bcc |
14 | 4cb17d3a4a2 |
15 | 26e8c6ba3e0 |
hex | 14aef119c9e |
1421350116510 has 16 divisors (see below), whose sum is σ = 3411240279696. Its totient is φ = 379026697728.
The previous prime is 1421350116479. The next prime is 1421350116551. The reversal of 1421350116510 is 156110531241.
It is a Harshad number since it is a multiple of its sum of digits (30), and also a Moran number because the ratio is a prime number: 47378337217 = 1421350116510 / (1 + 4 + 2 + 1 + 3 + 5 + 0 + 1 + 1 + 6 + 5 + 1 + 0).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23689168579 + ... + 23689168638.
It is an arithmetic number, because the mean of its divisors is an integer number (213202517481).
Almost surely, 21421350116510 is an apocalyptic number.
1421350116510 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1421350116510 is an abundant number, since it is smaller than the sum of its proper divisors (1989890163186).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1421350116510 is a wasteful number, since it uses less digits than its factorization.
1421350116510 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47378337227.
The product of its (nonzero) digits is 3600, while the sum is 30.
Adding to 1421350116510 its reverse (156110531241), we get a palindrome (1577460647751).
The spelling of 1421350116510 in words is "one trillion, four hundred twenty-one billion, three hundred fifty million, one hundred sixteen thousand, five hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •