Base | Representation |
---|---|
bin | 111110011011011111… |
… | …0101000001100111011 |
3 | 110211001022112102022100 |
4 | 1330312332220030323 |
5 | 4144031442422220 |
6 | 141331135354443 |
7 | 12454201241331 |
oct | 1746676501473 |
9 | 424038472270 |
10 | 134066373435 |
11 | 51947a77735 |
12 | 21b96682a23 |
13 | c847495167 |
14 | 66bb579b51 |
15 | 3749d49d90 |
hex | 1f36fa833b |
134066373435 has 24 divisors (see below), whose sum is σ = 232588731024. Its totient is φ = 71438368320.
The previous prime is 134066373377. The next prime is 134066373443. The reversal of 134066373435 is 534373660431.
134066373435 is a `hidden beast` number, since 1 + 3 + 4 + 0 + 6 + 637 + 3 + 4 + 3 + 5 = 666.
It is not a de Polignac number, because 134066373435 - 27 = 134066373307 is a prime.
It is a super-3 number, since 3×1340663734353 (a number of 34 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
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 23 ways as a sum of consecutive naturals, for example, 1275936 + ... + 1377005.
It is an arithmetic number, because the mean of its divisors is an integer number (9691197126).
Almost surely, 2134066373435 is an apocalyptic number.
134066373435 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
134066373435 is a deficient number, since it is larger than the sum of its proper divisors (98522357589).
134066373435 is a wasteful number, since it uses less digits than its factorization.
134066373435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2654075 (or 2654072 counting only the distinct ones).
The product of its (nonzero) digits is 1632960, while the sum is 45.
The spelling of 134066373435 in words is "one hundred thirty-four billion, sixty-six million, three hundred seventy-three thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •