Base | Representation |
---|---|
bin | 1100000100011110… |
… | …1101001111111011 |
3 | 22100210200020001011 |
4 | 3001013231033323 |
5 | 23113421214120 |
6 | 1253300534351 |
7 | 143201512204 |
oct | 30107551773 |
9 | 8323606034 |
10 | 3240023035 |
11 | 14129aa297 |
12 | 7650b13b7 |
13 | 3c83429c2 |
14 | 22a4465ab |
15 | 13e6a6c5a |
hex | c11ed3fb |
3240023035 has 4 divisors (see below), whose sum is σ = 3888027648. Its totient is φ = 2592018424.
The previous prime is 3240023027. The next prime is 3240023071. The reversal of 3240023035 is 5303200423.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 3240023035 - 23 = 3240023027 is a prime.
It is a super-2 number, since 2×32400230352 = 20995498534661222450, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3240022997 and 3240023015.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 324002299 + ... + 324002308.
It is an arithmetic number, because the mean of its divisors is an integer number (972006912).
Almost surely, 23240023035 is an apocalyptic number.
3240023035 is a deficient number, since it is larger than the sum of its proper divisors (648004613).
3240023035 is an equidigital number, since it uses as much as digits as its factorization.
3240023035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 648004612.
The product of its (nonzero) digits is 2160, while the sum is 22.
The square root of 3240023035 is about 56921.2002245209. The cubic root of 3240023035 is about 1479.7307513304.
Adding to 3240023035 its reverse (5303200423), we get a palindrome (8543223458).
The spelling of 3240023035 in words is "three billion, two hundred forty million, twenty-three thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •