Base | Representation |
---|---|
bin | 1000100111000100… |
… | …0001110110101010 |
3 | 12222002011210101211 |
4 | 2021301001312222 |
5 | 14213200044432 |
6 | 1021203503334 |
7 | 111163664023 |
oct | 21161016652 |
9 | 5862153354 |
10 | 2311331242 |
11 | a86760410 |
12 | 546087b4a |
13 | 2aab1192c |
14 | 17cd7bc4a |
15 | d7dadd47 |
hex | 89c41daa |
2311331242 has 8 divisors (see below), whose sum is σ = 3782178432. Its totient is φ = 1050605100.
The previous prime is 2311331161. The next prime is 2311331257. The reversal of 2311331242 is 2421331132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×23113312422 = 10684504220490525128, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 105060511 = 2311331242 / (2 + 3 + 1 + 1 + 3 + 3 + 1 + 2 + 4 + 2).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 52530234 + ... + 52530277.
It is an arithmetic number, because the mean of its divisors is an integer number (472772304).
Almost surely, 22311331242 is an apocalyptic number.
2311331242 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2311331242 is a deficient number, since it is larger than the sum of its proper divisors (1470847190).
2311331242 is a wasteful number, since it uses less digits than its factorization.
2311331242 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 105060524.
The product of its digits is 864, while the sum is 22.
The square root of 2311331242 is about 48076.3064513072. The cubic root of 2311331242 is about 1322.1702975626.
Adding to 2311331242 its reverse (2421331132), we get a palindrome (4732662374).
The spelling of 2311331242 in words is "two billion, three hundred eleven million, three hundred thirty-one thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •