Base | Representation |
---|---|
bin | 11110010111100001110… |
… | …11001001010111110011 |
3 | 10200202021000120101211000 |
4 | 33023300323021113303 |
5 | 114043413033403410 |
6 | 2115201544053043 |
7 | 135246010462566 |
oct | 17136073112763 |
9 | 3622230511730 |
10 | 1043424122355 |
11 | 37257179581a |
12 | 14a280764183 |
13 | 7751886b7b4 |
14 | 387056a04dd |
15 | 1c21db6cdc0 |
hex | f2f0ec95f3 |
1043424122355 has 64 divisors (see below), whose sum is σ = 1892297272320. Its totient is φ = 545407976448.
The previous prime is 1043424122303. The next prime is 1043424122443. The reversal of 1043424122355 is 5532214243401.
It is a happy number.
1043424122355 is a `hidden beast` number, since 1 + 0 + 4 + 3 + 4 + 2 + 412 + 235 + 5 = 666.
It is not a de Polignac number, because 1043424122355 - 27 = 1043424122227 is a prime.
It is a super-2 number, since 2×10434241223552 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 961984 + ... + 1735586.
It is an arithmetic number, because the mean of its divisors is an integer number (29567144880).
Almost surely, 21043424122355 is an apocalyptic number.
1043424122355 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1043424122355 is a deficient number, since it is larger than the sum of its proper divisors (848873149965).
1043424122355 is a wasteful number, since it uses less digits than its factorization.
1043424122355 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 773817 (or 773811 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 36.
Adding to 1043424122355 its reverse (5532214243401), we get a palindrome (6575638365756).
The spelling of 1043424122355 in words is "one trillion, forty-three billion, four hundred twenty-four million, one hundred twenty-two thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •