Base | Representation |
---|---|
bin | 11110000110101110001… |
… | …00111000100000110101 |
3 | 10122212222011002112122120 |
4 | 33003113010320200311 |
5 | 113421423014020113 |
6 | 2111110321150153 |
7 | 134506260311544 |
oct | 17032704704065 |
9 | 3585864075576 |
10 | 1034400532533 |
11 | 369761152175 |
12 | 14858278b359 |
13 | 7670b24c134 |
14 | 380cb0a815b |
15 | 1bd91881a23 |
hex | f0d7138835 |
1034400532533 has 24 divisors (see below), whose sum is σ = 1483648183680. Its totient is φ = 640819944960.
The previous prime is 1034400532471. The next prime is 1034400532553. The reversal of 1034400532533 is 3352350044301.
It is not a de Polignac number, because 1034400532533 - 222 = 1034396338229 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1034400532494 and 1034400532503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1034400532553) 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 23 ways as a sum of consecutive naturals, for example, 7482648 + ... + 7619633.
It is an arithmetic number, because the mean of its divisors is an integer number (61818674320).
Almost surely, 21034400532533 is an apocalyptic number.
It is an amenable number.
1034400532533 is a deficient number, since it is larger than the sum of its proper divisors (449247651147).
1034400532533 is a wasteful number, since it uses less digits than its factorization.
1034400532533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15102397 (or 15102380 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 33.
Adding to 1034400532533 its reverse (3352350044301), we get a palindrome (4386750576834).
The spelling of 1034400532533 in words is "one trillion, thirty-four billion, four hundred million, five hundred thirty-two thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •