Base | Representation |
---|---|
bin | 10011101011010010100… |
… | …110011100011011101000 |
3 | 11210021010212110120212020 |
4 | 103223102212130123220 |
5 | 134123202133233412 |
6 | 2513100455544440 |
7 | 166455420032613 |
oct | 23532246343350 |
9 | 4707125416766 |
10 | 1352153024232 |
11 | 48149914a20a |
12 | 19a08138b120 |
13 | 9a679c2baaa |
14 | 49631c0917a |
15 | 2528c80818c |
hex | 13ad299c6e8 |
1352153024232 has 64 divisors (see below), whose sum is σ = 3448521216000. Its totient is φ = 441708550080.
The previous prime is 1352153024231. The next prime is 1352153024263. The reversal of 1352153024232 is 2324203512531.
It is a junction number, because it is equal to n+sod(n) for n = 1352153024193 and 1352153024202.
It is not an unprimeable number, because it can be changed into a prime (1352153024231) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2091232 + ... + 2660367.
It is an arithmetic number, because the mean of its divisors is an integer number (53883144000).
Almost surely, 21352153024232 is an apocalyptic number.
1352153024232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1352153024232 is an abundant number, since it is smaller than the sum of its proper divisors (2096368191768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1352153024232 is a wasteful number, since it uses less digits than its factorization.
1352153024232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4751846 (or 4751842 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 33.
Adding to 1352153024232 its reverse (2324203512531), we get a palindrome (3676356536763).
The spelling of 1352153024232 in words is "one trillion, three hundred fifty-two billion, one hundred fifty-three million, twenty-four thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •