Base | Representation |
---|---|
bin | 1001011010000011011110… |
… | …0111101110100101110111 |
3 | 1100121210122101200202210000 |
4 | 2112200313213232211313 |
5 | 2323430400342110403 |
6 | 33555335045002343 |
7 | 2115162331605531 |
oct | 226406747564567 |
9 | 40553571622700 |
10 | 10343214410103 |
11 | 3328594984233 |
12 | 11b07016b33b3 |
13 | 5a048cc821a3 |
14 | 27a8856d8851 |
15 | 12e0b63d17a3 |
hex | 968379ee977 |
10343214410103 has 20 divisors (see below), whose sum is σ = 15452572453560. Its totient is φ = 6894763187472.
The previous prime is 10343214409993. The next prime is 10343214410117. The reversal of 10343214410103 is 30101441234301.
10343214410103 is a `hidden beast` number, since 1 + 0 + 34 + 3 + 214 + 410 + 1 + 0 + 3 = 666.
It is not a de Polignac number, because 10343214410103 - 217 = 10343214279031 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10343214410153) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 5813973 + ... + 7381646.
It is an arithmetic number, because the mean of its divisors is an integer number (772628622678).
Almost surely, 210343214410103 is an apocalyptic number.
10343214410103 is a deficient number, since it is larger than the sum of its proper divisors (5109358043457).
10343214410103 is an equidigital number, since it uses as much as digits as its factorization.
10343214410103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13205308 (or 13205299 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 10343214410103 its reverse (30101441234301), we get a palindrome (40444655644404).
The spelling of 10343214410103 in words is "ten trillion, three hundred forty-three billion, two hundred fourteen million, four hundred ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •