Base | Representation |
---|---|
bin | 1100000010001010… |
… | …0111101101011111 |
3 | 22100010101021221122 |
4 | 3000202213231133 |
5 | 23103424113043 |
6 | 1252312321155 |
7 | 143023051145 |
oct | 30042475537 |
9 | 8303337848 |
10 | 3230301023 |
11 | 1408469a74 |
12 | 7619a31bb |
13 | 3c631a831 |
14 | 229035595 |
15 | 13d8d6368 |
hex | c08a7b5f |
3230301023 has 8 divisors (see below), whose sum is σ = 3316133568. Its totient is φ = 3145181184.
The previous prime is 3230300963. The next prime is 3230301059. The reversal of 3230301023 is 3201030323.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3230301023 - 26 = 3230300959 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3230300992 and 3230301010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3230301323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 168986 + ... + 187127.
It is an arithmetic number, because the mean of its divisors is an integer number (414516696).
Almost surely, 23230301023 is an apocalyptic number.
3230301023 is a deficient number, since it is larger than the sum of its proper divisors (85832545).
3230301023 is a wasteful number, since it uses less digits than its factorization.
3230301023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 356353.
The product of its (nonzero) digits is 324, while the sum is 17.
The square root of 3230301023 is about 56835.7371994065. The cubic root of 3230301023 is about 1478.2492420082.
Adding to 3230301023 its reverse (3201030323), we get a palindrome (6431331346).
The spelling of 3230301023 in words is "three billion, two hundred thirty million, three hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •