Base | Representation |
---|---|
bin | 11110011110000110101000… |
… | …011010110011011110000000 |
3 | 122120111020111022000101020020 |
4 | 132132012220122303132000 |
5 | 120031110141122420334 |
6 | 1153003220134213440 |
7 | 40140624132051003 |
oct | 3636065032633600 |
9 | 576436438011206 |
10 | 134010100201344 |
11 | 39777400a22634 |
12 | 1304407b4b4280 |
13 | 59a1137a52403 |
14 | 25141a2aa553a |
15 | 1075d9c105e49 |
hex | 79e1a86b3780 |
134010100201344 has 32 divisors (see below), whose sum is σ = 355964328660840. Its totient is φ = 44670033400320.
The previous prime is 134010100201331. The next prime is 134010100201421. The reversal of 134010100201344 is 443102001010431.
It is a tau number, because it is divible by the number of its divisors (32).
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 pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 174492317587 + ... + 174492318354.
Almost surely, 2134010100201344 is an apocalyptic number.
It is an amenable number.
134010100201344 is an abundant number, since it is smaller than the sum of its proper divisors (221954228459496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134010100201344 is an equidigital number, since it uses as much as digits as its factorization.
134010100201344 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 348984635958 (or 348984635946 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 134010100201344 its reverse (443102001010431), we get a palindrome (577112101211775).
The spelling of 134010100201344 in words is "one hundred thirty-four trillion, ten billion, one hundred million, two hundred one thousand, three hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •