Base | Representation |
---|---|
bin | 111110001010110101010… |
… | …110100010000101011111 |
3 | 120010102101202102102122201 |
4 | 332022311112202011133 |
5 | 1024444021424400403 |
6 | 13030350123352331 |
7 | 620442043316020 |
oct | 76126526420537 |
9 | 16112352372581 |
10 | 4272240075103 |
11 | 13a7935166480 |
12 | 58bba46826a7 |
13 | 24cb41685680 |
14 | 10aac5746c47 |
15 | 761e652621d |
hex | 3e2b55a215f |
4272240075103 has 16 divisors (see below), whose sum is σ = 5736154507776. Its totient is φ = 3072939913440.
The previous prime is 4272240075041. The next prime is 4272240075107. The reversal of 4272240075103 is 3015700422724.
4272240075103 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 4272240075103 - 29 = 4272240074591 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4272240075107) 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, 2133985051 + ... + 2133987052.
It is an arithmetic number, because the mean of its divisors is an integer number (358509656736).
Almost surely, 24272240075103 is an apocalyptic number.
4272240075103 is a deficient number, since it is larger than the sum of its proper divisors (1463914432673).
4272240075103 is a wasteful number, since it uses less digits than its factorization.
4272240075103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4267972134.
The product of its (nonzero) digits is 94080, while the sum is 37.
Adding to 4272240075103 its reverse (3015700422724), we get a palindrome (7287940497827).
The spelling of 4272240075103 in words is "four trillion, two hundred seventy-two billion, two hundred forty million, seventy-five thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •