Base | Representation |
---|---|
bin | 1001101101010001101011… |
… | …1000011111100010010110 |
3 | 1101210101000201100001021202 |
4 | 2123110122320133202112 |
5 | 2344333203323404124 |
6 | 34411151323112502 |
7 | 2151062624266331 |
oct | 233243270374226 |
9 | 41711021301252 |
10 | 10673444747414 |
11 | 3445645338379 |
12 | 1244703072732 |
13 | 5c5669ac2847 |
14 | 28c8516c3618 |
15 | 137992a175ae |
hex | 9b51ae1f896 |
10673444747414 has 8 divisors (see below), whose sum is σ = 16021529912520. Its totient is φ = 5332934776576.
The previous prime is 10673444747393. The next prime is 10673444747417. The reversal of 10673444747414 is 41474744437601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×106734447474142 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10673444747414.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10673444747417) 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 3 ways as a sum of consecutive naturals, for example, 1893795044 + ... + 1893800679.
It is an arithmetic number, because the mean of its divisors is an integer number (2002691239065).
Almost surely, 210673444747414 is an apocalyptic number.
10673444747414 is a deficient number, since it is larger than the sum of its proper divisors (5348085165106).
10673444747414 is a wasteful number, since it uses less digits than its factorization.
10673444747414 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3787597134.
The product of its (nonzero) digits is 25288704, while the sum is 56.
The spelling of 10673444747414 in words is "ten trillion, six hundred seventy-three billion, four hundred forty-four million, seven hundred forty-seven thousand, four hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •