Base | Representation |
---|---|
bin | 11101101111000101111… |
… | …100000101111010011110 |
3 | 21020100110011200012121100 |
4 | 131233011330011322132 |
5 | 231434421131030024 |
6 | 4202423335413530 |
7 | 300430052135013 |
oct | 35570574057236 |
9 | 7210404605540 |
10 | 2043430330014 |
11 | 718683170607 |
12 | 2900448242a6 |
13 | 11a9051cb9b8 |
14 | 70c8c88170a |
15 | 3824ac0d7c9 |
hex | 1dbc5f05e9e |
2043430330014 has 96 divisors (see below), whose sum is σ = 4511527020000. Its totient is φ = 668340191232.
The previous prime is 2043430329953. The next prime is 2043430330037. The reversal of 2043430330014 is 4100330343402.
2043430330014 is a `hidden beast` number, since 2 + 0 + 4 + 343 + 0 + 3 + 300 + 14 = 666.
It is a super-2 number, since 2×20434303300142 (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 2043430330014.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 186626212 + ... + 186637160.
It is an arithmetic number, because the mean of its divisors is an integer number (46995073125).
Almost surely, 22043430330014 is an apocalyptic number.
2043430330014 is an abundant number, since it is smaller than the sum of its proper divisors (2468096689986).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2043430330014 is a wasteful number, since it uses less digits than its factorization.
2043430330014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11962 (or 11959 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 27.
Adding to 2043430330014 its reverse (4100330343402), we get a palindrome (6143760673416).
The spelling of 2043430330014 in words is "two trillion, forty-three billion, four hundred thirty million, three hundred thirty thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •