Base | Representation |
---|---|
bin | 101111000000010001000… |
… | …010010010111010011101 |
3 | 102102210110022022102110100 |
4 | 233000101002102322131 |
5 | 410410221403033041 |
6 | 10511515451131313 |
7 | 452236630236003 |
oct | 57002102227235 |
9 | 12383408272410 |
10 | 3230101221021 |
11 | 1035972a26844 |
12 | 442022443b39 |
13 | 1a579c19465c |
14 | b24a2a50a73 |
15 | 590506386b6 |
hex | 2f011092e9d |
3230101221021 has 48 divisors (see below), whose sum is σ = 4866436029312. Its totient is φ = 2062724227200.
The previous prime is 3230101221019. The next prime is 3230101221047. The reversal of 3230101221021 is 1201221010323.
3230101221021 is a `hidden beast` number, since 323 + 0 + 101 + 221 + 0 + 21 = 666.
It is not a de Polignac number, because 3230101221021 - 21 = 3230101221019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3230101220985 and 3230101221003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3230101221001) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 47982616 + ... + 48049886.
It is an arithmetic number, because the mean of its divisors is an integer number (101384083944).
Almost surely, 23230101221021 is an apocalyptic number.
It is an amenable number.
3230101221021 is a deficient number, since it is larger than the sum of its proper divisors (1636334808291).
3230101221021 is a wasteful number, since it uses less digits than its factorization.
3230101221021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69714 (or 69711 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 3230101221021 its reverse (1201221010323), we get a palindrome (4431322231344).
The spelling of 3230101221021 in words is "three trillion, two hundred thirty billion, one hundred one million, two hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •