Base | Representation |
---|---|
bin | 11110010001110010110… |
… | …01011001010100001001 |
3 | 10200110022102202000200120 |
4 | 33020321121121110021 |
5 | 114021111312403413 |
6 | 2113532232453453 |
7 | 135106501653465 |
oct | 17107131312411 |
9 | 3613272660616 |
10 | 1040345044233 |
11 | 371231723860 |
12 | 14976154a289 |
13 | 7714798a691 |
14 | 384d27914a5 |
15 | 1c0dd6a8723 |
hex | f239659509 |
1040345044233 has 32 divisors (see below), whose sum is σ = 1515508950912. Its totient is φ = 629562931200.
The previous prime is 1040345044153. The next prime is 1040345044259. The reversal of 1040345044233 is 3324405430401.
It is not a de Polignac number, because 1040345044233 - 213 = 1040345036041 is a prime.
It is a super-2 number, since 2×10403450442332 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 1040345044194 and 1040345044203.
It is not an unprimeable number, because it can be changed into a prime (1040345044033) by changing a digit.
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 in 31 ways as a sum of consecutive naturals, for example, 72841053 + ... + 72855333.
It is an arithmetic number, because the mean of its divisors is an integer number (47359654716).
Almost surely, 21040345044233 is an apocalyptic number.
It is an amenable number.
1040345044233 is a deficient number, since it is larger than the sum of its proper divisors (475163906679).
1040345044233 is a wasteful number, since it uses less digits than its factorization.
1040345044233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17465.
The product of its (nonzero) digits is 69120, while the sum is 33.
The spelling of 1040345044233 in words is "one trillion, forty billion, three hundred forty-five million, forty-four thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •