Base | Representation |
---|---|
bin | 11110001000110011110… |
… | …11011001111001111101 |
3 | 10122222212022120011020210 |
4 | 33010121323121321331 |
5 | 113431222130340331 |
6 | 2111413504503033 |
7 | 134546126542011 |
oct | 17043173317175 |
9 | 3588768504223 |
10 | 1035522121341 |
11 | 36a187272474 |
12 | 14883631aa79 |
13 | 7685971b456 |
14 | 38196026541 |
15 | 1be0a07e446 |
hex | f119ed9e7d |
1035522121341 has 16 divisors (see below), whose sum is σ = 1403400623040. Its totient is φ = 678996981120.
The previous prime is 1035522121331. The next prime is 1035522121363. The reversal of 1035522121341 is 1431212255301.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-1035522121341 is a prime.
It is a super-3 number, since 3×10355221213413 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1035522121299 and 1035522121308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1035522121331) 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, 3837505 + ... + 4098473.
It is an arithmetic number, because the mean of its divisors is an integer number (87712538940).
Almost surely, 21035522121341 is an apocalyptic number.
It is an amenable number.
1035522121341 is a deficient number, since it is larger than the sum of its proper divisors (367878501699).
1035522121341 is a wasteful number, since it uses less digits than its factorization.
1035522121341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 282716.
The product of its (nonzero) digits is 7200, while the sum is 30.
Adding to 1035522121341 its reverse (1431212255301), we get a palindrome (2466734376642).
The spelling of 1035522121341 in words is "one trillion, thirty-five billion, five hundred twenty-two million, one hundred twenty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •