Base | Representation |
---|---|
bin | 101111000010111110100… |
… | …010011011100000101101 |
3 | 102110001222011122120010220 |
4 | 233002332202123200231 |
5 | 410432202044300323 |
6 | 10513120353321553 |
7 | 452402024312004 |
oct | 57027642334055 |
9 | 12401864576126 |
10 | 3233012103213 |
11 | 1037127058702 |
12 | 4426b52662b9 |
13 | 1a5b44275659 |
14 | b269b499c3b |
15 | 59170e770e3 |
hex | 2f0be89b82d |
3233012103213 has 8 divisors (see below), whose sum is σ = 4319682144000. Its totient is φ = 2150841732288.
The previous prime is 3233012103151. The next prime is 3233012103229. The reversal of 3233012103213 is 3123012103323.
3233012103213 is digitally balanced in base 3, 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 not a de Polignac number, because 3233012103213 - 213 = 3233012095021 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3233012103413) 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, 1124915788 + ... + 1124918661.
It is an arithmetic number, because the mean of its divisors is an integer number (539960268000).
Almost surely, 23233012103213 is an apocalyptic number.
It is an amenable number.
3233012103213 is a deficient number, since it is larger than the sum of its proper divisors (1086670040787).
3233012103213 is a wasteful number, since it uses less digits than its factorization.
3233012103213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2249834931.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 3233012103213 its reverse (3123012103323), we get a palindrome (6356024206536).
The spelling of 3233012103213 in words is "three trillion, two hundred thirty-three billion, twelve million, one hundred three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •