Base | Representation |
---|---|
bin | 1001011001010110101110… |
… | …1100010011011110011101 |
3 | 1100120122122022100011120110 |
4 | 2112111223230103132131 |
5 | 2323231300444414401 |
6 | 33550031133240233 |
7 | 2114255562422220 |
oct | 226255354233635 |
9 | 40518568304513 |
10 | 10331203123101 |
11 | 3323490913563 |
12 | 11aa30b033079 |
13 | 59c2c7698083 |
14 | 27a0663bd5b7 |
15 | 12db11b819d6 |
hex | 9656bb1379d |
10331203123101 has 16 divisors (see below), whose sum is σ = 15751797092864. Its totient is φ = 5900165373744.
The previous prime is 10331203123093. The next prime is 10331203123117. The reversal of 10331203123101 is 10132130213301.
It is a happy number.
It is not a de Polignac number, because 10331203123101 - 23 = 10331203123093 is a prime.
It is a super-3 number, since 3×103312031231013 (a number of 40 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10331203123151) 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, 140765275 + ... + 140838648.
It is an arithmetic number, because the mean of its divisors is an integer number (984487318304).
Almost surely, 210331203123101 is an apocalyptic number.
It is an amenable number.
10331203123101 is a deficient number, since it is larger than the sum of its proper divisors (5420593969763).
10331203123101 is a wasteful number, since it uses less digits than its factorization.
10331203123101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 281605680.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 10331203123101 its reverse (10132130213301), we get a palindrome (20463333336402).
The spelling of 10331203123101 in words is "ten trillion, three hundred thirty-one billion, two hundred three million, one hundred twenty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •