Base | Representation |
---|---|
bin | 1001100110110111000… |
… | …00011000000100111111 |
3 | 1011120001020210020011221 |
4 | 10303123200120010333 |
5 | 20402021123241111 |
6 | 411351305054211 |
7 | 32564122335502 |
oct | 4633340300477 |
9 | 1146036706157 |
10 | 330100212031 |
11 | 117aa3a67097 |
12 | 53b85a87367 |
13 | 25188bacb65 |
14 | 11d969d5139 |
15 | 88beed0371 |
hex | 4cdb81813f |
330100212031 has 16 divisors (see below), whose sum is σ = 345926135808. Its totient is φ = 314734644000.
The previous prime is 330100212023. The next prime is 330100212053. The reversal of 330100212031 is 130212001033.
It is a cyclic number.
It is not a de Polignac number, because 330100212031 - 23 = 330100212023 is a prime.
It is a super-2 number, since 2×3301002120312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 330100211996 and 330100212014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (330100222031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 226911 + ... + 843616.
It is an arithmetic number, because the mean of its divisors is an integer number (21620383488).
Almost surely, 2330100212031 is an apocalyptic number.
330100212031 is a deficient number, since it is larger than the sum of its proper divisors (15825923777).
330100212031 is a wasteful number, since it uses less digits than its factorization.
330100212031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1070742.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 330100212031 its reverse (130212001033), we get a palindrome (460312213064).
The spelling of 330100212031 in words is "three hundred thirty billion, one hundred million, two hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •