Base | Representation |
---|---|
bin | 10101000111010100110… |
… | …010011100011000001101 |
3 | 12010201012212111212111001 |
4 | 111013110302130120031 |
5 | 142233043314100411 |
6 | 3030322423500301 |
7 | 206554326160162 |
oct | 25072462343015 |
9 | 5121185455431 |
10 | 1450973971981 |
11 | 50a399a86966 |
12 | 1b52602b7691 |
13 | a6a9839c981 |
14 | 50328430069 |
15 | 27b23293dc1 |
hex | 151d4c9c60d |
1450973971981 has 16 divisors (see below), whose sum is σ = 1483520093440. Its totient is φ = 1418841852480.
The previous prime is 1450973971973. The next prime is 1450973972011. The reversal of 1450973971981 is 1891793790541.
It is a cyclic number.
It is not a de Polignac number, because 1450973971981 - 23 = 1450973971973 is a prime.
It is a super-2 number, since 2×14509739719812 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1450973971081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3617191 + ... + 3998251.
It is an arithmetic number, because the mean of its divisors is an integer number (92720005840).
Almost surely, 21450973971981 is an apocalyptic number.
It is an amenable number.
1450973971981 is a deficient number, since it is larger than the sum of its proper divisors (32546121459).
1450973971981 is a wasteful number, since it uses less digits than its factorization.
1450973971981 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 381604.
The product of its (nonzero) digits is 17146080, while the sum is 64.
The spelling of 1450973971981 in words is "one trillion, four hundred fifty billion, nine hundred seventy-three million, nine hundred seventy-one thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •