Base | Representation |
---|---|
bin | 1001110001101011101101… |
… | …1111000000001001010011 |
3 | 1102001121102222222022222010 |
4 | 2130122323133000021103 |
5 | 2402103231313003133 |
6 | 34510032031314003 |
7 | 2156413022255616 |
oct | 234327337001123 |
9 | 42047388868863 |
10 | 10749153641043 |
11 | 3474766000754 |
12 | 125731197b903 |
13 | 5cc843c0025c |
14 | 2923945ac17d |
15 | 13992440c263 |
hex | 9c6bb7c0253 |
10749153641043 has 8 divisors (see below), whose sum is σ = 14335037886400. Its totient is φ = 7164685911528.
The previous prime is 10749153641041. The next prime is 10749153641053. The reversal of 10749153641043 is 34014635194701.
10749153641043 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10749153641043 - 21 = 10749153641041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10749153640983 and 10749153641001.
It is not an unprimeable number, because it can be changed into a prime (10749153641041) 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, 354111253 + ... + 354141606.
It is an arithmetic number, because the mean of its divisors is an integer number (1791879735800).
Almost surely, 210749153641043 is an apocalyptic number.
10749153641043 is a deficient number, since it is larger than the sum of its proper divisors (3585884245357).
10749153641043 is an equidigital number, since it uses as much as digits as its factorization.
10749153641043 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 708257921.
The product of its (nonzero) digits is 1088640, while the sum is 48.
The spelling of 10749153641043 in words is "ten trillion, seven hundred forty-nine billion, one hundred fifty-three million, six hundred forty-one thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •