Base | Representation |
---|---|
bin | 11110010001001101101… |
… | …00011101000011101000 |
3 | 10200102111201021100111012 |
4 | 33020212310131003220 |
5 | 114014442020322334 |
6 | 2113441300323052 |
7 | 135065665533323 |
oct | 17104664350350 |
9 | 3612451240435 |
10 | 1040033370344 |
11 | 3710917a6631 |
12 | 1496950a3488 |
13 | 770c8233167 |
14 | 384a321d7ba |
15 | 1c0c11409ce |
hex | f226d1d0e8 |
1040033370344 has 8 divisors (see below), whose sum is σ = 1950062569410. Its totient is φ = 520016685168.
The previous prime is 1040033370319. The next prime is 1040033370353. The reversal of 1040033370344 is 4430733300401.
It can be written as a sum of positive squares in only one way, i.e., 891683604100 + 148349766244 = 944290^2 + 385162^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-2 number, since 2×10400333703442 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1040033370344.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65002085639 + ... + 65002085654.
Almost surely, 21040033370344 is an apocalyptic number.
It is an amenable number.
1040033370344 is a deficient number, since it is larger than the sum of its proper divisors (910029199066).
1040033370344 is a wasteful number, since it uses less digits than its factorization.
1040033370344 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130004171299 (or 130004171295 counting only the distinct ones).
The product of its (nonzero) digits is 36288, while the sum is 32.
Adding to 1040033370344 its reverse (4430733300401), we get a palindrome (5470766670745).
The spelling of 1040033370344 in words is "one trillion, forty billion, thirty-three million, three hundred seventy thousand, three hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •