Base | Representation |
---|---|
bin | 111111010101001110101… |
… | …000100010010100101010 |
3 | 120102001120210200221222200 |
4 | 333111032220202110222 |
5 | 1032301121001320132 |
6 | 13131200431401030 |
7 | 626300422100613 |
oct | 77251650422452 |
9 | 16361523627880 |
10 | 4352121120042 |
11 | 14287a6a04893 |
12 | 5a3578683176 |
13 | 257531c6b077 |
14 | 110902798c0a |
15 | 7831e348d7c |
hex | 3f54ea2252a |
4352121120042 has 48 divisors (see below), whose sum is σ = 9932068186560. Its totient is φ = 1373498634816.
The previous prime is 4352121120037. The next prime is 4352121120077. The reversal of 4352121120042 is 2400211212534.
4352121120042 is a `hidden beast` number, since 435 + 2 + 1 + 21 + 1 + 200 + 4 + 2 = 666.
4352121120042 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 4352121119988 and 4352121120015.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3409803 + ... + 4508990.
It is an arithmetic number, because the mean of its divisors is an integer number (206918087220).
Almost surely, 24352121120042 is an apocalyptic number.
4352121120042 is an abundant number, since it is smaller than the sum of its proper divisors (5579947066518).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4352121120042 is a wasteful number, since it uses less digits than its factorization.
4352121120042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7920427 (or 7920424 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
Adding to 4352121120042 its reverse (2400211212534), we get a palindrome (6752332332576).
The spelling of 4352121120042 in words is "four trillion, three hundred fifty-two billion, one hundred twenty-one million, one hundred twenty thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •