Base | Representation |
---|---|
bin | 11110100001110100001111… |
… | …101110110010100100000111 |
3 | 122121101122001012002111121222 |
4 | 132201310033232302210013 |
5 | 120044300201030023411 |
6 | 1153320333112030555 |
7 | 40165225504256453 |
oct | 3641641756624407 |
9 | 577348035074558 |
10 | 134265236564231 |
11 | 39865626831293 |
12 | 1308560409245b |
13 | 59bc207ca5886 |
14 | 2522687713663 |
15 | 107c830d104db |
hex | 7a1d0fbb2907 |
134265236564231 has 8 divisors (see below), whose sum is σ = 135494849697504. Its totient is φ = 133040102896800.
The previous prime is 134265236564213. The next prime is 134265236564269. The reversal of 134265236564231 is 132465632562431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 134265236564231 - 214 = 134265236547847 is a prime.
It is a super-2 number, since 2×1342652365642312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134265236569231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1119806240 + ... + 1119926133.
It is an arithmetic number, because the mean of its divisors is an integer number (16936856212188).
Almost surely, 2134265236564231 is an apocalyptic number.
134265236564231 is a deficient number, since it is larger than the sum of its proper divisors (1229613133273).
134265236564231 is a wasteful number, since it uses less digits than its factorization.
134265236564231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2239732921.
The product of its digits is 18662400, while the sum is 53.
The spelling of 134265236564231 in words is "one hundred thirty-four trillion, two hundred sixty-five billion, two hundred thirty-six million, five hundred sixty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •