Base | Representation |
---|---|
bin | 100101101001111001101001… |
… | …0000100100110100000100000 |
3 | 1121102201202210122100020202222 |
4 | 1023103303102010212200200 |
5 | 321403103211414420000 |
6 | 3132233414015530212 |
7 | 126523303124353553 |
oct | 11323632204464040 |
9 | 1542652718306688 |
10 | 331214222420000 |
11 | 96598187901287 |
12 | 31193650b29968 |
13 | 112a74a08449aa |
14 | 5bb0bd516069a |
15 | 2845996c3da85 |
hex | 12d3cd2126820 |
331214222420000 has 120 divisors (see below), whose sum is σ = 828647463243600. Its totient is φ = 130240168352000.
The previous prime is 331214222419961. The next prime is 331214222420069. The reversal of 331214222420000 is 24222412133.
It is a super-2 number, since 2×3312142224200002 (a number of 30 digits) contains 22 as substring.
It is an unprimeable number.
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 19 ways as a sum of consecutive naturals, for example, 139165010 + ... + 141525009.
It is an arithmetic number, because the mean of its divisors is an integer number (6905395527030).
Almost surely, 2331214222420000 is an apocalyptic number.
It is an amenable number.
331214222420000 is an abundant number, since it is smaller than the sum of its proper divisors (497433240823600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
331214222420000 is an equidigital number, since it uses as much as digits as its factorization.
331214222420000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 280690108 (or 280690085 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 331214222420000 its reverse (24222412133), we get a palindrome (331238444832133).
The spelling of 331214222420000 in words is "three hundred thirty-one trillion, two hundred fourteen billion, two hundred twenty-two million, four hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •