Base | Representation |
---|---|
bin | 10100011001010000110… |
… | …111100010011011101011 |
3 | 11221222120001202101000211 |
4 | 110121100313202123223 |
5 | 140430301103342411 |
6 | 2551503025241551 |
7 | 203153606035003 |
oct | 24312067423353 |
9 | 4858501671024 |
10 | 1401516074731 |
11 | 4a041a317713 |
12 | 1a7758a932b7 |
13 | a2215a36a06 |
14 | 4bb95ad5003 |
15 | 266cb2d2221 |
hex | 14650de26eb |
1401516074731 has 4 divisors (see below), whose sum is σ = 1483958196792. Its totient is φ = 1319073952672.
The previous prime is 1401516074713. The next prime is 1401516074737. The reversal of 1401516074731 is 1374706151041.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1401516074731 - 29 = 1401516074219 is a prime.
It is a super-2 number, since 2×14015160747312 (a number of 25 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1401516074737) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 41221061005 + ... + 41221061038.
It is an arithmetic number, because the mean of its divisors is an integer number (370989549198).
Almost surely, 21401516074731 is an apocalyptic number.
1401516074731 is a deficient number, since it is larger than the sum of its proper divisors (82442122061).
1401516074731 is an equidigital number, since it uses as much as digits as its factorization.
1401516074731 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82442122060.
The product of its (nonzero) digits is 70560, while the sum is 40.
The spelling of 1401516074731 in words is "one trillion, four hundred one billion, five hundred sixteen million, seventy-four thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •