Base | Representation |
---|---|
bin | 1001111011010111110… |
… | …10111101000101000111 |
3 | 1012121110202100111112012 |
4 | 10331223322331011013 |
5 | 21042044414024111 |
6 | 420412152044435 |
7 | 33434045640401 |
oct | 4755372750507 |
9 | 1177422314465 |
10 | 341113033031 |
11 | 121735461551 |
12 | 5613a09371b |
13 | 262226760a4 |
14 | 1271d481b71 |
15 | 8d16c5348b |
hex | 4f6bebd147 |
341113033031 has 4 divisors (see below), whose sum is σ = 350332304232. Its totient is φ = 331893761832.
The previous prime is 341113033007. The next prime is 341113033043. The reversal of 341113033031 is 130330311143.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-341113033031 is a prime.
It is a super-2 number, since 2×3411130330312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 341113032988 and 341113033006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (341113033081) 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, 4609635545 + ... + 4609635618.
It is an arithmetic number, because the mean of its divisors is an integer number (87583076058).
Almost surely, 2341113033031 is an apocalyptic number.
341113033031 is a deficient number, since it is larger than the sum of its proper divisors (9219271201).
341113033031 is an equidigital number, since it uses as much as digits as its factorization.
341113033031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9219271200.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 341113033031 its reverse (130330311143), we get a palindrome (471443344174).
The spelling of 341113033031 in words is "three hundred forty-one billion, one hundred thirteen million, thirty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •