Base | Representation |
---|---|
bin | 1010010100001101001… |
… | …00011101110100011110 |
3 | 1020212212212211211201120 |
4 | 11022012210131310132 |
5 | 21301400411241132 |
6 | 430455122551410 |
7 | 34415322666330 |
oct | 5120644356436 |
9 | 1225785754646 |
10 | 354445024542 |
11 | 127356a81054 |
12 | 5883ab08566 |
13 | 2756876716b |
14 | 13225d4b450 |
15 | 93473d302c |
hex | 528691dd1e |
354445024542 has 32 divisors (see below), whose sum is σ = 857816531712. Its totient is φ = 95312947584.
The previous prime is 354445024541. The next prime is 354445024613. The reversal of 354445024542 is 245420544453.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 354445024494 and 354445024503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (354445024541) 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, 248210088 + ... + 248211515.
It is an arithmetic number, because the mean of its divisors is an integer number (26806766616).
Almost surely, 2354445024542 is an apocalyptic number.
354445024542 is an abundant number, since it is smaller than the sum of its proper divisors (503371507170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
354445024542 is a wasteful number, since it uses less digits than its factorization.
354445024542 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 496421632.
The product of its (nonzero) digits is 1536000, while the sum is 42.
Adding to 354445024542 its reverse (245420544453), we get a palindrome (599865568995).
The spelling of 354445024542 in words is "three hundred fifty-four billion, four hundred forty-five million, twenty-four thousand, five hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •