Base | Representation |
---|---|
bin | 1011110111001110011101… |
… | …0110011111010110011110 |
3 | 1201011221022010021211210020 |
4 | 2331303213112133112132 |
5 | 3202200341422040014 |
6 | 43424020051053010 |
7 | 2514232443624006 |
oct | 275634726372636 |
9 | 51157263254706 |
10 | 13043402143134 |
11 | 4179748518280 |
12 | 1567a94ba1166 |
13 | 737cab83410c |
14 | 33143839b006 |
15 | 17944eb9b1a9 |
hex | bdce759f59e |
13043402143134 has 32 divisors (see below), whose sum is σ = 28462213862784. Its totient is φ = 3952006949280.
The previous prime is 13043402143117. The next prime is 13043402143157. The reversal of 13043402143134 is 43134120434031.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 13043402143095 and 13043402143104.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12991224 + ... + 13959179.
It is an arithmetic number, because the mean of its divisors is an integer number (889444183212).
Almost surely, 213043402143134 is an apocalyptic number.
13043402143134 is an abundant number, since it is smaller than the sum of its proper divisors (15418811719650).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13043402143134 is a wasteful number, since it uses less digits than its factorization.
13043402143134 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26957752.
The product of its (nonzero) digits is 41472, while the sum is 33.
Adding to 13043402143134 its reverse (43134120434031), we get a palindrome (56177522577165).
The spelling of 13043402143134 in words is "thirteen trillion, forty-three billion, four hundred two million, one hundred forty-three thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •