Base | Representation |
---|---|
bin | 100100110111011100001… |
… | …101011011010001001111 |
3 | 22222012020002221221022202 |
4 | 210313130031123101033 |
5 | 313001431120310211 |
6 | 5215501454232115 |
7 | 351014522525042 |
oct | 44673415332117 |
9 | 8865202857282 |
10 | 2533430244431 |
11 | 897470365769 |
12 | 34abb47b563b |
13 | 154b9462c368 |
14 | 8a89391cc59 |
15 | 45d7896853b |
hex | 24ddc35b44f |
2533430244431 has 32 divisors (see below), whose sum is σ = 2604407904000. Its totient is φ = 2463825351168.
The previous prime is 2533430244427. The next prime is 2533430244439. The reversal of 2533430244431 is 1344420343352.
It is a cyclic number.
It is not a de Polignac number, because 2533430244431 - 22 = 2533430244427 is a prime.
It is a super-2 number, since 2×25334302444312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2533430244439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 651432935 + ... + 651436823.
It is an arithmetic number, because the mean of its divisors is an integer number (81387747000).
Almost surely, 22533430244431 is an apocalyptic number.
2533430244431 is a deficient number, since it is larger than the sum of its proper divisors (70977659569).
2533430244431 is a wasteful number, since it uses less digits than its factorization.
2533430244431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4583.
The product of its (nonzero) digits is 414720, while the sum is 38.
Adding to 2533430244431 its reverse (1344420343352), we get a palindrome (3877850587783).
The spelling of 2533430244431 in words is "two trillion, five hundred thirty-three billion, four hundred thirty million, two hundred forty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •