Base | Representation |
---|---|
bin | 101000000001011100000011… |
… | …0111001000101100001011100 |
3 | 1201011110211101210210020200020 |
4 | 1100002320012321011201130 |
5 | 332120321244140341220 |
6 | 3244421331103432140 |
7 | 134103103124416161 |
oct | 12002700671054134 |
9 | 1634424353706606 |
10 | 352041405012060 |
11 | a2197a15479825 |
12 | 33597b962b5650 |
13 | 1215849255659a |
14 | 62d0c75916068 |
15 | 2aa76114b8040 |
hex | 1402e06e4585c |
352041405012060 has 48 divisors (see below), whose sum is σ = 985895058333696. Its totient is φ = 93860648546112.
The previous prime is 352041405011957. The next prime is 352041405012061. The reversal of 352041405012060 is 60210504140253.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (352041405012061) 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 15 ways as a sum of consecutive naturals, for example, 532775104 + ... + 533435463.
It is an arithmetic number, because the mean of its divisors is an integer number (20539480381952).
Almost surely, 2352041405012060 is an apocalyptic number.
352041405012060 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
352041405012060 is an abundant number, since it is smaller than the sum of its proper divisors (633853653321636).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
352041405012060 is a wasteful number, since it uses less digits than its factorization.
352041405012060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1066216082 (or 1066216080 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 33.
The spelling of 352041405012060 in words is "three hundred fifty-two trillion, forty-one billion, four hundred five million, twelve thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •