Base | Representation |
---|---|
bin | 100101100001000101001101… |
… | …1001101100000101111001110 |
3 | 1121021102220011020010001122211 |
4 | 1023002022123031200233032 |
5 | 321223223321013400220 |
6 | 3125504514232501034 |
7 | 126336603125301163 |
oct | 11302123315405716 |
9 | 1537386136101584 |
10 | 330002121231310 |
11 | 96170128330000 |
12 | 3101875684a77a |
13 | 1121a0b3156908 |
14 | 5b6c28b7d806a |
15 | 28241a4995b5a |
hex | 12c229b360bce |
330002121231310 has 40 divisors (see below), whose sum is σ = 653400143201880. Its totient is φ = 120000771303600.
The previous prime is 330002121231271. The next prime is 330002121231323. The reversal of 330002121231310 is 13132121200033.
It is a super-2 number, since 2×3300021212313102 (a number of 30 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1126833036 + ... + 1127125855.
It is an arithmetic number, because the mean of its divisors is an integer number (16335003580047).
Almost surely, 2330002121231310 is an apocalyptic number.
330002121231310 is a deficient number, since it is larger than the sum of its proper divisors (323398021970570).
330002121231310 is an equidigital number, since it uses as much as digits as its factorization.
330002121231310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2253958942 (or 2253958909 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 330002121231310 its reverse (13132121200033), we get a palindrome (343134242431343).
The spelling of 330002121231310 in words is "three hundred thirty trillion, two billion, one hundred twenty-one million, two hundred thirty-one thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •