Base | Representation |
---|---|
bin | 110000000001100101000… |
… | …111000000101100110111 |
3 | 102200111110210021111102210 |
4 | 300001211013000230313 |
5 | 413032333143020043 |
6 | 11004034424304503 |
7 | 460301543343333 |
oct | 60014507005467 |
9 | 12614423244383 |
10 | 3300231220023 |
11 | 106269053a001 |
12 | 453734912133 |
13 | 1ac29752719a |
14 | b5a36a267c3 |
15 | 5aca7377633 |
hex | 300651c0b37 |
3300231220023 has 32 divisors (see below), whose sum is σ = 4554605848320. Its totient is φ = 2123942446080.
The previous prime is 3300231220021. The next prime is 3300231220061. The reversal of 3300231220023 is 3200221320033.
It is not a de Polignac number, because 3300231220023 - 21 = 3300231220021 is a prime.
It is a super-3 number, since 3×33002312200233 (a number of 39 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3300231220021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 88201543 + ... + 88238951.
It is an arithmetic number, because the mean of its divisors is an integer number (142331432760).
Almost surely, 23300231220023 is an apocalyptic number.
3300231220023 is a deficient number, since it is larger than the sum of its proper divisors (1254374628297).
3300231220023 is a wasteful number, since it uses less digits than its factorization.
3300231220023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43647.
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 3300231220023 its reverse (3200221320033), we get a palindrome (6500452540056).
The spelling of 3300231220023 in words is "three trillion, three hundred billion, two hundred thirty-one million, two hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •