Base | Representation |
---|---|
bin | 101111000000110111101… |
… | …110000101001011110101 |
3 | 102102212010112112122222101 |
4 | 233000313232011023311 |
5 | 410413034024431313 |
6 | 10512104113502101 |
7 | 452262000610120 |
oct | 57006756051365 |
9 | 12385115478871 |
10 | 3230750233333 |
11 | 1036176310357 |
12 | 442183871931 |
13 | 1a5873790bcc |
14 | b2524d153b7 |
15 | 5908c5d85dd |
hex | 2f037b852f5 |
3230750233333 has 8 divisors (see below), whose sum is σ = 3692734520768. Its totient is φ = 2768878080864.
The previous prime is 3230750233309. The next prime is 3230750233363. The reversal of 3230750233333 is 3333320570323.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3230750233333 - 225 = 3230716678901 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3230750233292 and 3230750233301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3230750233363) 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 7 ways as a sum of consecutive naturals, for example, 27971991 + ... + 28087252.
It is an arithmetic number, because the mean of its divisors is an integer number (461591815096).
Almost surely, 23230750233333 is an apocalyptic number.
It is an amenable number.
3230750233333 is a deficient number, since it is larger than the sum of its proper divisors (461984287435).
3230750233333 is an equidigital number, since it uses as much as digits as its factorization.
3230750233333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56067483.
The product of its (nonzero) digits is 306180, while the sum is 37.
The spelling of 3230750233333 in words is "three trillion, two hundred thirty billion, seven hundred fifty million, two hundred thirty-three thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.158 sec. • engine limits •