Base | Representation |
---|---|
bin | 111111010011010111100… |
… | …000001011111100000101 |
3 | 120101212102111211121211120 |
4 | 333103113200023330011 |
5 | 1032233022321130001 |
6 | 13130230233024153 |
7 | 626200042444443 |
oct | 77232740137405 |
9 | 16355374747746 |
10 | 4350122442501 |
11 | 1427970790870 |
12 | 5a30bb255059 |
13 | 2572a3b67934 |
14 | 110793165b93 |
15 | 78253b48236 |
hex | 3f4d780bf05 |
4350122442501 has 16 divisors (see below), whose sum is σ = 6348061429248. Its totient is φ = 2627850092400.
The previous prime is 4350122442481. The next prime is 4350122442511. The reversal of 4350122442501 is 1052442210534.
It is a de Polignac number, because none of the positive numbers 2k-4350122442501 is a prime.
It is a super-2 number, since 2×43501224425012 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4350122442511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 214683505 + ... + 214703766.
It is an arithmetic number, because the mean of its divisors is an integer number (396753839328).
Almost surely, 24350122442501 is an apocalyptic number.
It is an amenable number.
4350122442501 is a deficient number, since it is larger than the sum of its proper divisors (1997938986747).
4350122442501 is a wasteful number, since it uses less digits than its factorization.
4350122442501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 429387592.
The product of its (nonzero) digits is 38400, while the sum is 33.
The spelling of 4350122442501 in words is "four trillion, three hundred fifty billion, one hundred twenty-two million, four hundred forty-two thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •