Base | Representation |
---|---|
bin | 101000011000111… |
… | …0001101101000010 |
3 | 10111110002121110200 |
4 | 1100301301231002 |
5 | 10233414212142 |
6 | 342251110030 |
7 | 45404141661 |
oct | 12061615502 |
9 | 3443077420 |
10 | 1355225922 |
11 | 635a98326 |
12 | 319a42316 |
13 | 187a02c3b |
14 | cbdb8dd8 |
15 | 7de9d64c |
hex | 50c71b42 |
1355225922 has 18 divisors (see below), whose sum is σ = 2936661273. Its totient is φ = 451689912.
The previous prime is 1355225891. The next prime is 1355225923. The reversal of 1355225922 is 2295225531.
1355225922 is a `hidden beast` number, since 13 + 5 + 52 + 2 + 592 + 2 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 1273847481 + 81378441 = 35691^2 + 9021^2 .
It is a tau number, because it is divible by the number of its divisors (18).
It is an ABA number since it can be written as A⋅BA, here for A=2, B=26031.
It is not an unprimeable number, because it can be changed into a prime (1355225923) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 151848 + ... + 160524.
Almost surely, 21355225922 is an apocalyptic number.
1355225922 is an abundant number, since it is smaller than the sum of its proper divisors (1581435351).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1355225922 is an frugal number, since it uses more digits than its factorization.
1355225922 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17362 (or 8682 counting only the distinct ones).
The product of its digits is 54000, while the sum is 36.
The square root of 1355225922 is about 36813.3932421340. The cubic root of 1355225922 is about 1106.6337216003.
The spelling of 1355225922 in words is "one billion, three hundred fifty-five million, two hundred twenty-five thousand, nine hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •