Base | Representation |
---|---|
bin | 1001011111010101110101… |
… | …0101000110010000001111 |
3 | 1100221111002021122120201010 |
4 | 2113311131111012100033 |
5 | 2331422404042424321 |
6 | 34105155450020303 |
7 | 2124556162216644 |
oct | 227653525062017 |
9 | 40844067576633 |
10 | 10434041373711 |
11 | 336306338231a |
12 | 120622b417693 |
13 | 5a8c06208237 |
14 | 28102037ddcb |
15 | 13163015e676 |
hex | 97d5d54640f |
10434041373711 has 8 divisors (see below), whose sum is σ = 13953337229104. Its totient is φ = 6935386550400.
The previous prime is 10434041373703. The next prime is 10434041373739. The reversal of 10434041373711 is 11737314043401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10434041373711 - 23 = 10434041373703 is a prime.
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 10434041373711.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10434041373611) 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, 5160256840 + ... + 5160258861.
It is an arithmetic number, because the mean of its divisors is an integer number (1744167153638).
Almost surely, 210434041373711 is an apocalyptic number.
10434041373711 is a deficient number, since it is larger than the sum of its proper divisors (3519295855393).
10434041373711 is a wasteful number, since it uses less digits than its factorization.
10434041373711 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10320516041.
The product of its (nonzero) digits is 84672, while the sum is 39.
The spelling of 10434041373711 in words is "ten trillion, four hundred thirty-four billion, forty-one million, three hundred seventy-three thousand, seven hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •