Base | Representation |
---|---|
bin | 1001101001011010110… |
… | …10110001010010010101 |
3 | 1011200121000200222101022 |
4 | 10310231122301102111 |
5 | 20412324431133013 |
6 | 412135520210525 |
7 | 32643150353525 |
oct | 4645532612225 |
9 | 1150530628338 |
10 | 331474474133 |
11 | 1186397765a0 |
12 | 542aa169a45 |
13 | 253478195ba |
14 | 12087327685 |
15 | 895098e008 |
hex | 4d2d6b1495 |
331474474133 has 64 divisors (see below), whose sum is σ = 379837382400. Its totient is φ = 286690959360.
The previous prime is 331474474087. The next prime is 331474474147.
331474474133 is nontrivially palindromic in base 10.
It is a cyclic number.
It is not a de Polignac number, because 331474474133 - 28 = 331474473877 is a prime.
It is a super-2 number, since 2×3314744741332 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (331474476133) 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 63 ways as a sum of consecutive naturals, for example, 810450833 + ... + 810451241.
It is an arithmetic number, because the mean of its divisors is an integer number (5934959100).
Almost surely, 2331474474133 is an apocalyptic number.
It is an amenable number.
331474474133 is a deficient number, since it is larger than the sum of its proper divisors (48362908267).
331474474133 is a wasteful number, since it uses less digits than its factorization.
331474474133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 822.
The product of its digits is 1016064, while the sum is 44.
It can be divided in two parts, 3314 and 74474133, that added together give a palindrome (74477447).
The spelling of 331474474133 in words is "three hundred thirty-one billion, four hundred seventy-four million, four hundred seventy-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •