Base | Representation |
---|---|
bin | 10001011101111001111… |
… | …101111001000000101101 |
3 | 11020202021220111202222012 |
4 | 101131321331321000231 |
5 | 124131300042034041 |
6 | 2315232441531005 |
7 | 152502411604400 |
oct | 21357175710055 |
9 | 4222256452865 |
10 | 1200342143021 |
11 | 42307593521a |
12 | 1747741a3a65 |
13 | 8926544c8b8 |
14 | 4214db4bd37 |
15 | 21354c713eb |
hex | 11779f7902d |
1200342143021 has 24 divisors (see below), whose sum is σ = 1504026653184. Its totient is φ = 952385243040.
The previous prime is 1200342143009. The next prime is 1200342143047. The reversal of 1200342143021 is 1203412430021.
It is not a de Polignac number, because 1200342143021 - 210 = 1200342141997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1200342143081) 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 23 ways as a sum of consecutive naturals, for example, 17143730 + ... + 17213603.
It is an arithmetic number, because the mean of its divisors is an integer number (62667777216).
Almost surely, 21200342143021 is an apocalyptic number.
It is an amenable number.
1200342143021 is a deficient number, since it is larger than the sum of its proper divisors (303684510163).
1200342143021 is a wasteful number, since it uses less digits than its factorization.
1200342143021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34357401 (or 34357394 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 1200342143021 its reverse (1203412430021), we get a palindrome (2403754573042).
The spelling of 1200342143021 in words is "one trillion, two hundred billion, three hundred forty-two million, one hundred forty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •