Base | Representation |
---|---|
bin | 110000000111000000… |
… | …0001000110111001111 |
3 | 100212200010202201021022 |
4 | 1200032000020313033 |
5 | 3143041404214211 |
6 | 115243432224355 |
7 | 10315135431116 |
oct | 1401600106717 |
9 | 325603681238 |
10 | 103314132431 |
11 | 3a8a7152924 |
12 | 1803383b0bb |
13 | 99862cc553 |
14 | 5001278c7d |
15 | 2a4a17ebdb |
hex | 180e008dcf |
103314132431 has 8 divisors (see below), whose sum is σ = 103809940224. Its totient is φ = 102819167640.
The previous prime is 103314132407. The next prime is 103314132433. The reversal of 103314132431 is 134231413301.
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 103314132431 - 218 = 103313870287 is a prime.
It is a super-2 number, since 2×1033141324312 (a number of 23 digits) contains 22 as substring.
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 103314132431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103314132433) 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, 35636 + ... + 455958.
It is an arithmetic number, because the mean of its divisors is an integer number (12976242528).
Almost surely, 2103314132431 is an apocalyptic number.
103314132431 is a deficient number, since it is larger than the sum of its proper divisors (495807793).
103314132431 is an equidigital number, since it uses as much as digits as its factorization.
103314132431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 421501.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 103314132431 its reverse (134231413301), we get a palindrome (237545545732).
The spelling of 103314132431 in words is "one hundred three billion, three hundred fourteen million, one hundred thirty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •