Base | Representation |
---|---|
bin | 100101101001110011100101… |
… | …0100010000011101010110011 |
3 | 1121102200112012212002202012110 |
4 | 1023103213022202003222303 |
5 | 321402400040010201003 |
6 | 3132223422540300403 |
7 | 126522332522324610 |
oct | 11323471242035263 |
9 | 1542615185082173 |
10 | 331201211022003 |
11 | 965927102513a3 |
12 | 3119101b541703 |
13 | 112a61a8cb201a |
14 | 5bb031d0a9507 |
15 | 28454847d9a03 |
hex | 12d39ca883ab3 |
331201211022003 has 16 divisors (see below), whose sum is σ = 505167757174016. Its totient is φ = 189077760799200.
The previous prime is 331201211021999. The next prime is 331201211022041. The reversal of 331201211022003 is 300220112102133.
It is not a de Polignac number, because 331201211022003 - 22 = 331201211021999 is a prime.
It is a super-2 number, since 2×3312012110220032 (a number of 30 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (331201211022083) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7503063676 + ... + 7503107817.
It is an arithmetic number, because the mean of its divisors is an integer number (31572984823376).
Almost surely, 2331201211022003 is an apocalyptic number.
331201211022003 is a deficient number, since it is larger than the sum of its proper divisors (173966546152013).
331201211022003 is a wasteful number, since it uses less digits than its factorization.
331201211022003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15006172554.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 331201211022003 its reverse (300220112102133), we get a palindrome (631421323124136).
The spelling of 331201211022003 in words is "three hundred thirty-one trillion, two hundred one billion, two hundred eleven million, twenty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •