Base | Representation |
---|---|
bin | 101111000000011000010… |
… | …100000110101111111101 |
3 | 102102210202211002012220021 |
4 | 233000120110012233331 |
5 | 410410444133032201 |
6 | 10511535532252141 |
7 | 452242642163512 |
oct | 57003024065775 |
9 | 12383684065807 |
10 | 3230223330301 |
11 | 1035a25949300 |
12 | 442057311051 |
13 | 1a57bb579676 |
14 | b24b4d59309 |
15 | 5905b208ea1 |
hex | 2f018506bfd |
3230223330301 has 24 divisors (see below), whose sum is σ = 3563254612512. Its totient is φ = 2926090437600.
The previous prime is 3230223330263. The next prime is 3230223330337. The reversal of 3230223330301 is 1030333220323.
3230223330301 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3230223330301 - 221 = 3230221233149 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 (3230223330001) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 76356111 + ... + 76398403.
It is an arithmetic number, because the mean of its divisors is an integer number (148468942188).
Almost surely, 23230223330301 is an apocalyptic number.
It is an amenable number.
3230223330301 is a deficient number, since it is larger than the sum of its proper divisors (333031282211).
3230223330301 is a wasteful number, since it uses less digits than its factorization.
3230223330301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44553 (or 44542 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 25.
Adding to 3230223330301 its reverse (1030333220323), we get a palindrome (4260556550624).
The spelling of 3230223330301 in words is "three trillion, two hundred thirty billion, two hundred twenty-three million, three hundred thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •