Base | Representation |
---|---|
bin | 11110100001000000110100… |
… | …110011101111000111111000 |
3 | 122121012100112022222211010020 |
4 | 132201000310303233013320 |
5 | 120042344112123334000 |
6 | 1153235122304050440 |
7 | 40161232336502013 |
oct | 3641006463570770 |
9 | 577170468884106 |
10 | 134210024043000 |
11 | 398441737a6954 |
12 | 13076975603a20 |
13 | 59b6c49357979 |
14 | 251db2aa0037a |
15 | 107b19da34ba0 |
hex | 7a1034cef1f8 |
134210024043000 has 64 divisors (see below), whose sum is σ = 418735275023520. Its totient is φ = 35789339744000.
The previous prime is 134210024042989. The next prime is 134210024043013. The reversal of 134210024043000 is 340420012431.
It is a super-4 number, since 4×1342100240430004 (a number of 58 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22368334341 + ... + 22368340340.
Almost surely, 2134210024043000 is an apocalyptic number.
134210024043000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
134210024043000 is an abundant number, since it is smaller than the sum of its proper divisors (284525250980520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134210024043000 is a wasteful number, since it uses less digits than its factorization.
134210024043000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44736674705 (or 44736674691 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 134210024043000 its reverse (340420012431), we get a palindrome (134550444055431).
The spelling of 134210024043000 in words is "one hundred thirty-four trillion, two hundred ten billion, twenty-four million, forty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.238 sec. • engine limits •