Base | Representation |
---|---|
bin | 10110011010100010011… |
… | …111000001110110111000 |
3 | 12110020211211222121020122 |
4 | 112122202133001312320 |
5 | 200214041012210112 |
6 | 3135340520112412 |
7 | 216166446551360 |
oct | 26324237016670 |
9 | 5406754877218 |
10 | 1540324335032 |
11 | 54427aa2710a |
12 | 20a637605708 |
13 | b2337737292 |
14 | 547a2d439a0 |
15 | 2a10259a872 |
hex | 166a27c1db8 |
1540324335032 has 32 divisors (see below), whose sum is σ = 3303014707200. Its totient is φ = 659675060064.
The previous prime is 1540324335007. The next prime is 1540324335037. The reversal of 1540324335032 is 2305334230451.
It is a junction number, because it is equal to n+sod(n) for n = 1540324334983 and 1540324335001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1540324335037) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9585032 + ... + 9744407.
It is an arithmetic number, because the mean of its divisors is an integer number (103219209600).
Almost surely, 21540324335032 is an apocalyptic number.
It is an amenable number.
1540324335032 is an abundant number, since it is smaller than the sum of its proper divisors (1762690372168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1540324335032 is a wasteful number, since it uses less digits than its factorization.
1540324335032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19330875 (or 19330871 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 35.
Adding to 1540324335032 its reverse (2305334230451), we get a palindrome (3845658565483).
The spelling of 1540324335032 in words is "one trillion, five hundred forty billion, three hundred twenty-four million, three hundred thirty-five thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •