Base | Representation |
---|---|
bin | 1001110001010010101110… |
… | …0100110010000110110000 |
3 | 1102000222010102002222011022 |
4 | 2130110223210302012300 |
5 | 2402001011213120000 |
6 | 34503002154235012 |
7 | 2156054532456242 |
oct | 234245344620660 |
9 | 42028112088138 |
10 | 10742444270000 |
11 | 347193280aa03 |
12 | 1255b5aa25a68 |
13 | 5cc014b93911 |
14 | 291d194a6092 |
15 | 1396803a0585 |
hex | 9c52b9321b0 |
10742444270000 has 50 divisors (see below), whose sum is σ = 26008531846308. Its totient is φ = 4296977704000.
The previous prime is 10742444269961. The next prime is 10742444270003. The reversal of 10742444270000 is 7244424701.
It is a tau number, because it is divible by the number of its divisors (50).
It is not an unprimeable number, because it can be changed into a prime (10742444270003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 537112214 + ... + 537132213.
Almost surely, 210742444270000 is an apocalyptic number.
10742444270000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10742444270000 is an abundant number, since it is smaller than the sum of its proper divisors (15266087576308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10742444270000 is an equidigital number, since it uses as much as digits as its factorization.
10742444270000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1074244455 (or 1074244434 counting only the distinct ones).
The product of its (nonzero) digits is 50176, while the sum is 35.
Adding to 10742444270000 its reverse (7244424701), we get a palindrome (10749688694701).
The spelling of 10742444270000 in words is "ten trillion, seven hundred forty-two billion, four hundred forty-four million, two hundred seventy thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •