Base | Representation |
---|---|
bin | 10101000111000000011… |
… | …111000011110110011101 |
3 | 12010200100010120022010001 |
4 | 111013000133003312131 |
5 | 142231344114041321 |
6 | 3030224535014301 |
7 | 206543021665645 |
oct | 25070037036635 |
9 | 5120303508101 |
10 | 1450633346461 |
11 | 50a234784972 |
12 | 1b518620a391 |
13 | a6a42949700 |
14 | 502d50c3525 |
15 | 27b0340cc91 |
hex | 151c07c3d9d |
1450633346461 has 12 divisors (see below), whose sum is σ = 1571496860820. Its totient is φ = 1338455664000.
The previous prime is 1450633346413. The next prime is 1450633346467. The reversal of 1450633346461 is 1646433360541.
It can be written as a sum of positive squares in 6 ways, for example, as 256025880100 + 1194607466361 = 505990^2 + 1092981^2 .
It is not a de Polignac number, because 1450633346461 - 237 = 1313194392989 is a prime.
It is a super-2 number, since 2×14506333464612 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1450633346467) 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, 1508040 + ... + 2274961.
It is an arithmetic number, because the mean of its divisors is an integer number (130958071735).
Almost surely, 21450633346461 is an apocalyptic number.
It is an amenable number.
1450633346461 is a deficient number, since it is larger than the sum of its proper divisors (120863514359).
1450633346461 is a wasteful number, since it uses less digits than its factorization.
1450633346461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3785296 (or 3785283 counting only the distinct ones).
The product of its (nonzero) digits is 1866240, while the sum is 46.
The spelling of 1450633346461 in words is "one trillion, four hundred fifty billion, six hundred thirty-three million, three hundred forty-six thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •