Base | Representation |
---|---|
bin | 1000000101111101… |
… | …11001101101001111 |
3 | 102012210220102121012 |
4 | 10002332321231033 |
5 | 32344310323043 |
6 | 1555052355435 |
7 | 212446661423 |
oct | 40276715517 |
9 | 12183812535 |
10 | 4345011023 |
11 | 192a711101 |
12 | a13175b7b |
13 | 54324bb52 |
14 | 2d30c2b83 |
15 | 1a66c5a18 |
hex | 102fb9b4f |
4345011023 has 4 divisors (see below), whose sum is σ = 4345248048. Its totient is φ = 4344774000.
The previous prime is 4345011017. The next prime is 4345011053. The reversal of 4345011023 is 3201105434.
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 4345011023 - 24 = 4345011007 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4345011023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4345011053) by changing a digit.
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, 88478 + ... + 128523.
It is an arithmetic number, because the mean of its divisors is an integer number (1086312012).
Almost surely, 24345011023 is an apocalyptic number.
4345011023 is a deficient number, since it is larger than the sum of its proper divisors (237025).
4345011023 is a wasteful number, since it uses less digits than its factorization.
4345011023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237024.
The product of its (nonzero) digits is 1440, while the sum is 23.
The square root of 4345011023 is about 65916.6976038697. The cubic root of 4345011023 is about 1631.7875959822.
Adding to 4345011023 its reverse (3201105434), we get a palindrome (7546116457).
The spelling of 4345011023 in words is "four billion, three hundred forty-five million, eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •