Base | Representation |
---|---|
bin | 10000000000011111001… |
… | …010101001010111010101 |
3 | 10220011101022000011202121 |
4 | 100000133022221113111 |
5 | 121010332313343331 |
6 | 2201203205135541 |
7 | 142321611035422 |
oct | 20003712512725 |
9 | 3804338004677 |
10 | 1100034512341 |
11 | 394581893696 |
12 | 15923b3ba5b1 |
13 | 7c96aca008b |
14 | 3b355cccd49 |
15 | 1d933a1bc11 |
hex | 1001f2a95d5 |
1100034512341 has 4 divisors (see below), whose sum is σ = 1100191644684. Its totient is φ = 1099877380000.
The previous prime is 1100034512273. The next prime is 1100034512363. The reversal of 1100034512341 is 1432154300011.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 205137432241 + 894897080100 = 452921^2 + 945990^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1100034512341 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100034512371) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 78555670 + ... + 78569671.
It is an arithmetic number, because the mean of its divisors is an integer number (275047911171).
Almost surely, 21100034512341 is an apocalyptic number.
It is an amenable number.
1100034512341 is a deficient number, since it is larger than the sum of its proper divisors (157132343).
1100034512341 is an equidigital number, since it uses as much as digits as its factorization.
1100034512341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 157132342.
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 1100034512341 its reverse (1432154300011), we get a palindrome (2532188812352).
The spelling of 1100034512341 in words is "one trillion, one hundred billion, thirty-four million, five hundred twelve thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •