Base | Representation |
---|---|
bin | 111101010101101111100… |
… | …010111000000111111101 |
3 | 112220222020221001120222222 |
4 | 331111233202320013331 |
5 | 1023030244442044013 |
6 | 12544241340415125 |
7 | 613353302431520 |
oct | 75255742700775 |
9 | 15828227046888 |
10 | 4215234331133 |
11 | 1385741986281 |
12 | 580b355474a5 |
13 | 24765837b417 |
14 | 108038802bb7 |
15 | 749abad0508 |
hex | 3d56f8b81fd |
4215234331133 has 8 divisors (see below), whose sum is σ = 4818192379968. Its totient is φ = 3612471711264.
The previous prime is 4215234331127. The next prime is 4215234331153. The reversal of 4215234331133 is 3311334325124.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4215234331133 - 26 = 4215234331069 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4215234331093 and 4215234331102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4215234331103) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48811016 + ... + 48897297.
It is an arithmetic number, because the mean of its divisors is an integer number (602274047496).
Almost surely, 24215234331133 is an apocalyptic number.
It is an amenable number.
4215234331133 is a deficient number, since it is larger than the sum of its proper divisors (602958048835).
4215234331133 is an equidigital number, since it uses as much as digits as its factorization.
4215234331133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 97714483.
The product of its digits is 77760, while the sum is 35.
Adding to 4215234331133 its reverse (3311334325124), we get a palindrome (7526568656257).
The spelling of 4215234331133 in words is "four trillion, two hundred fifteen billion, two hundred thirty-four million, three hundred thirty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •