Base | Representation |
---|---|
bin | 101111000000010111000… |
… | …111000000111010011111 |
3 | 102102210201102001111101011 |
4 | 233000113013000322133 |
5 | 410410423444340221 |
6 | 10511533531200051 |
7 | 452242305334255 |
oct | 57002707007237 |
9 | 12383642044334 |
10 | 3230203121311 |
11 | 1035a154a5a61 |
12 | 4420505a6027 |
13 | 1a57b732209a |
14 | b24b23b85d5 |
15 | 590595661e1 |
hex | 2f0171c0e9f |
3230203121311 has 8 divisors (see below), whose sum is σ = 3252666564000. Its totient is φ = 3207801991680.
The previous prime is 3230203121309. The next prime is 3230203121377. The reversal of 3230203121311 is 1131213020323.
3230203121311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 3230203121311 - 21 = 3230203121309 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3230203121711) 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, 15474226 + ... + 15681583.
It is an arithmetic number, because the mean of its divisors is an integer number (406583320500).
Almost surely, 23230203121311 is an apocalyptic number.
3230203121311 is a deficient number, since it is larger than the sum of its proper divisors (22463442689).
3230203121311 is a wasteful number, since it uses less digits than its factorization.
3230203121311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31156529.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 3230203121311 its reverse (1131213020323), we get a palindrome (4361416141634).
The spelling of 3230203121311 in words is "three trillion, two hundred thirty billion, two hundred three million, one hundred twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •