Base | Representation |
---|---|
bin | 1001010011100001110111… |
… | …0110110101010001001111 |
3 | 1100020002021212010201112210 |
4 | 2110320131312311101033 |
5 | 2320111304412343203 |
6 | 33432035231001503 |
7 | 2104113342500061 |
oct | 224703566652117 |
9 | 40202255121483 |
10 | 10231113012303 |
11 | 3294a99630927 |
12 | 1192a37069293 |
13 | 592a362c8141 |
14 | 27528d3c3731 |
15 | 12b204a97803 |
hex | 94e1ddb544f |
10231113012303 has 4 divisors (see below), whose sum is σ = 13641484016408. Its totient is φ = 6820742008200.
The previous prime is 10231113012301. The next prime is 10231113012311. The reversal of 10231113012303 is 30321031113201.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 10231113012303 - 21 = 10231113012301 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10231113012303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10231113012301) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1705185502048 + ... + 1705185502053.
It is an arithmetic number, because the mean of its divisors is an integer number (3410371004102).
Almost surely, 210231113012303 is an apocalyptic number.
10231113012303 is a deficient number, since it is larger than the sum of its proper divisors (3410371004105).
10231113012303 is an equidigital number, since it uses as much as digits as its factorization.
10231113012303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3410371004104.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 10231113012303 its reverse (30321031113201), we get a palindrome (40552144125504).
The spelling of 10231113012303 in words is "ten trillion, two hundred thirty-one billion, one hundred thirteen million, twelve thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •