Base | Representation |
---|---|
bin | 11110010111000000000… |
… | …11100101101110111000 |
3 | 10200201112022001112200102 |
4 | 33023200003211232320 |
5 | 114042323111414000 |
6 | 2115113514254532 |
7 | 135236003150564 |
oct | 17134003455670 |
9 | 3621468045612 |
10 | 1043141123000 |
11 | 372436a73159 |
12 | 14a201a27448 |
13 | 774a2043b62 |
14 | 386b9c746a4 |
15 | 1c203dbb3d5 |
hex | f2e00e5bb8 |
1043141123000 has 32 divisors (see below), whose sum is σ = 2440950230160. Its totient is φ = 417256448800.
The previous prime is 1043141122963. The next prime is 1043141123051. The reversal of 1043141123000 is 3211413401.
1043141123000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×10431411230002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 521569562 + ... + 521571561.
Almost surely, 21043141123000 is an apocalyptic number.
1043141123000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1043141123000 is an abundant number, since it is smaller than the sum of its proper divisors (1397809107160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1043141123000 is a wasteful number, since it uses less digits than its factorization.
1043141123000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1043141144 (or 1043141130 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 1043141123000 its reverse (3211413401), we get a palindrome (1046352536401).
The spelling of 1043141123000 in words is "one trillion, forty-three billion, one hundred forty-one million, one hundred twenty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •