Base | Representation |
---|---|
bin | 1001010011100010101011… |
… | …1011011011001100001101 |
3 | 1100020002212010210201011120 |
4 | 2110320222323123030031 |
5 | 2320112232033220023 |
6 | 33432113103311153 |
7 | 2104121644541130 |
oct | 224705273331415 |
9 | 40202763721146 |
10 | 10231332320013 |
11 | 32950a1400a72 |
12 | 1192a985ab4b9 |
13 | 592a6c88270c |
14 | 2752b0590217 |
15 | 12b218e678e3 |
hex | 94e2aedb30d |
10231332320013 has 16 divisors (see below), whose sum is σ = 15591498147456. Its totient is φ = 5846139417600.
The previous prime is 10231332319991. The next prime is 10231332320059. The reversal of 10231332320013 is 31002323313201.
It is not a de Polignac number, because 10231332320013 - 214 = 10231332303629 is a prime.
It is a super-2 number, since 2×102313323200132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10231312320013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13633956 + ... + 14364797.
It is an arithmetic number, because the mean of its divisors is an integer number (974468634216).
Almost surely, 210231332320013 is an apocalyptic number.
It is an amenable number.
10231332320013 is a deficient number, since it is larger than the sum of its proper divisors (5360165827443).
10231332320013 is a wasteful number, since it uses less digits than its factorization.
10231332320013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28016164.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 10231332320013 its reverse (31002323313201), we get a palindrome (41233655633214).
The spelling of 10231332320013 in words is "ten trillion, two hundred thirty-one billion, three hundred thirty-two million, three hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •