Base | Representation |
---|---|
bin | 101000010000000101010101… |
… | …1000111101111100000100000 |
3 | 1201102121020210022002110121011 |
4 | 1100200022223013233200200 |
5 | 332401311002440341000 |
6 | 3253002131213110304 |
7 | 134401400154214303 |
oct | 12040125307574040 |
9 | 1642536708073534 |
10 | 354054205012000 |
11 | a28a35aa611a59 |
12 | 338620b0a88394 |
13 | 122732259052cc |
14 | 636045a34cb3a |
15 | 2adeb6808d2ba |
hex | 14202ab1ef820 |
354054205012000 has 48 divisors (see below), whose sum is σ = 869911181724312. Its totient is φ = 141621682003200.
The previous prime is 354054205011989. The next prime is 354054205012009. The reversal of 354054205012000 is 210502450453.
It can be written as a sum of positive squares in 4 ways, for example, as 199871620659216 + 154182584352784 = 14137596^2 + 12417028^2 .
It is not an unprimeable number, because it can be changed into a prime (354054205012009) 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 7 ways as a sum of consecutive naturals, for example, 44256771627 + ... + 44256779626.
Almost surely, 2354054205012000 is an apocalyptic number.
It is an amenable number.
354054205012000 is an abundant number, since it is smaller than the sum of its proper divisors (515856976712312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
354054205012000 is an equidigital number, since it uses as much as digits as its factorization.
354054205012000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88513551278 (or 88513551260 counting only the distinct ones).
The product of its (nonzero) digits is 24000, while the sum is 31.
Adding to 354054205012000 its reverse (210502450453), we get a palindrome (354264707462453).
The spelling of 354054205012000 in words is "three hundred fifty-four trillion, fifty-four billion, two hundred five million, twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •