Base | Representation |
---|---|
bin | 1001010010010011011000… |
… | …0011000011000101100011 |
3 | 1100011001220112010121002012 |
4 | 2110210312003003011203 |
5 | 2314240132233000311 |
6 | 33414232433343135 |
7 | 2102436260221424 |
oct | 224446603030543 |
9 | 40131815117065 |
10 | 10210044031331 |
11 | 3287067753661 |
12 | 118a937107aab |
13 | 590a593105b1 |
14 | 27425115564b |
15 | 12a8c007178b |
hex | 949360c3163 |
10210044031331 has 16 divisors (see below), whose sum is σ = 10711628697600. Its totient is φ = 9718446477600.
The previous prime is 10210044031249. The next prime is 10210044031333. The reversal of 10210044031331 is 13313044001201.
It is a cyclic number.
It is not a de Polignac number, because 10210044031331 - 234 = 10192864162147 is a prime.
It is a super-2 number, since 2×102100440313312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10210044031297 and 10210044031306.
It is not an unprimeable number, because it can be changed into a prime (10210044031333) 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, 30469226 + ... + 30802496.
It is an arithmetic number, because the mean of its divisors is an integer number (669476793600).
Almost surely, 210210044031331 is an apocalyptic number.
10210044031331 is a deficient number, since it is larger than the sum of its proper divisors (501584666269).
10210044031331 is a wasteful number, since it uses less digits than its factorization.
10210044031331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 348250.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 10210044031331 its reverse (13313044001201), we get a palindrome (23523088032532).
The spelling of 10210044031331 in words is "ten trillion, two hundred ten billion, forty-four million, thirty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •