Base | Representation |
---|---|
bin | 10101000110111110110… |
… | …100110110001110000001 |
3 | 12010200021012011201120010 |
4 | 111012332310312032001 |
5 | 142231320002101421 |
6 | 3030222102135133 |
7 | 206542233222510 |
oct | 25067664661601 |
9 | 5120235151503 |
10 | 1450605503361 |
11 | 50a21aa97a43 |
12 | 1b5178a214a9 |
13 | a6a39c4b3c1 |
14 | 502d1516677 |
15 | 27b00c5d076 |
hex | 151bed36381 |
1450605503361 has 16 divisors (see below), whose sum is σ = 2211125261184. Its totient is φ = 828662888064.
The previous prime is 1450605503251. The next prime is 1450605503371. The reversal of 1450605503361 is 1633055060541.
It is not a de Polignac number, because 1450605503361 - 27 = 1450605503233 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1450605503371) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10535910 + ... + 10672703.
It is an arithmetic number, because the mean of its divisors is an integer number (138195328824).
Almost surely, 21450605503361 is an apocalyptic number.
It is an amenable number.
1450605503361 is a deficient number, since it is larger than the sum of its proper divisors (760519757823).
1450605503361 is a wasteful number, since it uses less digits than its factorization.
1450605503361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21211880.
The product of its (nonzero) digits is 162000, while the sum is 39.
The spelling of 1450605503361 in words is "one trillion, four hundred fifty billion, six hundred five million, five hundred three thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •