Base | Representation |
---|---|
bin | 111110101011110100… |
… | …1011010101101001111 |
3 | 110212110111212011110112 |
4 | 1331113221122231033 |
5 | 4201142300230023 |
6 | 141501355030235 |
7 | 12503605020122 |
oct | 1752751325517 |
9 | 425414764415 |
10 | 134614461263 |
11 | 520a9399187 |
12 | 2210a13b37b |
13 | c903bb6199 |
14 | 673028c3b9 |
15 | 377d011478 |
hex | 1f57a5ab4f |
134614461263 has 16 divisors (see below), whose sum is σ = 138433802976. Its totient is φ = 130821250560.
The previous prime is 134614461253. The next prime is 134614461313. The reversal of 134614461263 is 362164416431.
It is a cyclic number.
It is not a de Polignac number, because 134614461263 - 212 = 134614457167 is a prime.
It is a super-2 number, since 2×1346144612632 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 134614461263.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134614461253) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25701881 + ... + 25707117.
It is an arithmetic number, because the mean of its divisors is an integer number (8652112686).
Almost surely, 2134614461263 is an apocalyptic number.
134614461263 is a deficient number, since it is larger than the sum of its proper divisors (3819341713).
134614461263 is a wasteful number, since it uses less digits than its factorization.
134614461263 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7594.
The product of its digits is 248832, while the sum is 41.
Adding to 134614461263 its reverse (362164416431), we get a palindrome (496778877694).
The spelling of 134614461263 in words is "one hundred thirty-four billion, six hundred fourteen million, four hundred sixty-one thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •