Base | Representation |
---|---|
bin | 10100100100111111000… |
… | …000111100001000100101 |
3 | 12000012001011100202001222 |
4 | 110210333000330020211 |
5 | 141132034432420201 |
6 | 3001343525430125 |
7 | 204110516003660 |
oct | 24447700741045 |
9 | 5005034322058 |
10 | 1414101451301 |
11 | 4a5798449380 |
12 | 1aa08b86b345 |
13 | a3470246cb6 |
14 | 4c62b3706d7 |
15 | 26bb613291b |
hex | 1493f03c225 |
1414101451301 has 8 divisors (see below), whose sum is σ = 1763035575744. Its totient is φ = 1101897234720.
The previous prime is 1414101451297. The next prime is 1414101451313. The reversal of 1414101451301 is 1031541014141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1414101451301 - 22 = 1414101451297 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1414101451391) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9182476880 + ... + 9182477033.
It is an arithmetic number, because the mean of its divisors is an integer number (220379446968).
Almost surely, 21414101451301 is an apocalyptic number.
1414101451301 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1414101451301 is a deficient number, since it is larger than the sum of its proper divisors (348934124443).
1414101451301 is a wasteful number, since it uses less digits than its factorization.
1414101451301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18364953931.
The product of its (nonzero) digits is 960, while the sum is 26.
Adding to 1414101451301 its reverse (1031541014141), we get a palindrome (2445642465442).
The spelling of 1414101451301 in words is "one trillion, four hundred fourteen billion, one hundred one million, four hundred fifty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •