Base | Representation |
---|---|
bin | 101000000100111010111011… |
… | …0100100111010000110010000 |
3 | 1201020011120210022120220221020 |
4 | 1100021311312210322012100 |
5 | 332201142000123443212 |
6 | 3245425243410555440 |
7 | 134152505504035164 |
oct | 12011656644720620 |
9 | 1636146708526836 |
10 | 352520020140432 |
11 | a23619a02116a1 |
12 | 336548a9598b80 |
13 | 12191659116b61 |
14 | 630a0ba95cca4 |
15 | 2ab4cc49c7d8c |
hex | 1409d7693a190 |
352520020140432 has 40 divisors (see below), whose sum is σ = 916263692450784. Its totient is φ = 116785773540864.
The previous prime is 352520020140391. The next prime is 352520020140437. The reversal of 352520020140432 is 234041020025253.
It is a super-2 number, since 2×3525200201404322 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 352520020140393 and 352520020140402.
It is not an unprimeable number, because it can be changed into a prime (352520020140437) 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, 22528112073 + ... + 22528127720.
Almost surely, 2352520020140432 is an apocalyptic number.
It is an amenable number.
352520020140432 is an abundant number, since it is smaller than the sum of its proper divisors (563743672310352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
352520020140432 is a wasteful number, since it uses less digits than its factorization.
352520020140432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45056239967 (or 45056239961 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 33.
Adding to 352520020140432 its reverse (234041020025253), we get a palindrome (586561040165685).
The spelling of 352520020140432 in words is "three hundred fifty-two trillion, five hundred twenty billion, twenty million, one hundred forty thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •