Base | Representation |
---|---|
bin | 1110001100001010101110… |
… | …01111100011010111000110 |
3 | 11002111010000100211220222210 |
4 | 13012011113033203113012 |
5 | 13042223103140201410 |
6 | 150211034242404250 |
7 | 6400305102002241 |
oct | 706052717432706 |
9 | 132433010756883 |
10 | 31204401100230 |
11 | 9a40791a18966 |
12 | 35bb756960686 |
13 | 1454740783977 |
14 | 79c4301d8258 |
15 | 391a71069220 |
hex | 1c61573e35c6 |
31204401100230 has 64 divisors (see below), whose sum is σ = 76319563806720. Its totient is φ = 8162461447296.
The previous prime is 31204401100123. The next prime is 31204401100241. The reversal of 31204401100230 is 3200110440213.
It is a super-3 number, since 3×312044011002303 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 31204401100197 and 31204401100206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5553391 + ... + 9656549.
It is an arithmetic number, because the mean of its divisors is an integer number (1192493184480).
Almost surely, 231204401100230 is an apocalyptic number.
31204401100230 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
31204401100230 is an abundant number, since it is smaller than the sum of its proper divisors (45115162706490).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31204401100230 is a wasteful number, since it uses less digits than its factorization.
31204401100230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4108005.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 31204401100230 its reverse (3200110440213), we get a palindrome (34404511540443).
The spelling of 31204401100230 in words is "thirty-one trillion, two hundred four billion, four hundred one million, one hundred thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •