Base | Representation |
---|---|
bin | 1001010001110011001110… |
… | …0111100000111000110111 |
3 | 1100010020122000221020211211 |
4 | 2110130303213200320313 |
5 | 2314114443302334333 |
6 | 33410244203342251 |
7 | 2102012350350403 |
oct | 224346347407067 |
9 | 40106560836754 |
10 | 10201413324343 |
11 | 328343896476a |
12 | 1189128821987 |
13 | 58ccb220cb97 |
14 | 273a72bd0103 |
15 | 12a5674deecd |
hex | 947339e0e37 |
10201413324343 has 8 divisors (see below), whose sum is σ = 10210629852288. Its totient is φ = 10192198956984.
The previous prime is 10201413324341. The next prime is 10201413324419. The reversal of 10201413324343 is 34342331410201.
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 10201413324343 - 21 = 10201413324341 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10201413324341) 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 7 ways as a sum of consecutive naturals, for example, 8983030 + ... + 10054732.
It is an arithmetic number, because the mean of its divisors is an integer number (1276328731536).
Almost surely, 210201413324343 is an apocalyptic number.
10201413324343 is a deficient number, since it is larger than the sum of its proper divisors (9216527945).
10201413324343 is a wasteful number, since it uses less digits than its factorization.
10201413324343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1080293.
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 10201413324343 its reverse (34342331410201), we get a palindrome (44543744734544).
The spelling of 10201413324343 in words is "ten trillion, two hundred one billion, four hundred thirteen million, three hundred twenty-four thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •