Base | Representation |
---|---|
bin | 11110010001100100001… |
… | …00100110001010011001 |
3 | 10200102222212111102022020 |
4 | 33020302010212022121 |
5 | 114020333332320241 |
6 | 2113512122445053 |
7 | 135103450253223 |
oct | 17106204461231 |
9 | 3612885442266 |
10 | 1040222151321 |
11 | 371179316571 |
12 | 149728363789 |
13 | 7712838ca92 |
14 | 384c0321413 |
15 | 1c0d29d0b66 |
hex | f232126299 |
1040222151321 has 16 divisors (see below), whose sum is σ = 1483089015168. Its totient is φ = 646226144000.
The previous prime is 1040222151299. The next prime is 1040222151323. The reversal of 1040222151321 is 1231512220401.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1040222151321 - 223 = 1040213762713 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1040222151291 and 1040222151300.
It is not an unprimeable number, because it can be changed into a prime (1040222151323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 100967685 + ... + 100977986.
It is an arithmetic number, because the mean of its divisors is an integer number (92693063448).
Almost surely, 21040222151321 is an apocalyptic number.
It is an amenable number.
1040222151321 is a deficient number, since it is larger than the sum of its proper divisors (442866863847).
1040222151321 is a wasteful number, since it uses less digits than its factorization.
1040222151321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201945792.
The product of its (nonzero) digits is 960, while the sum is 24.
Adding to 1040222151321 its reverse (1231512220401), we get a palindrome (2271734371722).
The spelling of 1040222151321 in words is "one trillion, forty billion, two hundred twenty-two million, one hundred fifty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •