Base | Representation |
---|---|
bin | 1001011101100011011101… |
… | …1001001100111001100111 |
3 | 1100211112211122212112022210 |
4 | 2113120313121030321213 |
5 | 2330422020034103411 |
6 | 34043121204054503 |
7 | 2122421316116166 |
oct | 227306731147147 |
9 | 40745748775283 |
10 | 10403340144231 |
11 | 335103932a1a1 |
12 | 12002a1694433 |
13 | 5a6052793268 |
14 | 27d74ab5b3dd |
15 | 130934bbdca6 |
hex | 9763764ce67 |
10403340144231 has 8 divisors (see below), whose sum is σ = 13892559329664. Its totient is φ = 6924840527480.
The previous prime is 10403340144217. The next prime is 10403340144283. The reversal of 10403340144231 is 13244104330401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10403340144231 - 29 = 10403340143719 is a prime.
It is a super-2 number, since 2×104033401442312 (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 (10403340140231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2679889905 + ... + 2679893786.
It is an arithmetic number, because the mean of its divisors is an integer number (1736569916208).
Almost surely, 210403340144231 is an apocalyptic number.
10403340144231 is a deficient number, since it is larger than the sum of its proper divisors (3489219185433).
10403340144231 is an equidigital number, since it uses as much as digits as its factorization.
10403340144231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5359784341.
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 10403340144231 its reverse (13244104330401), we get a palindrome (23647444474632).
The spelling of 10403340144231 in words is "ten trillion, four hundred three billion, three hundred forty million, one hundred forty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •