Base | Representation |
---|---|
bin | 111100111110100… |
… | …011011011100110 |
3 | 2122022000100201120 |
4 | 330332203123212 |
5 | 4043343443024 |
6 | 245303034410 |
7 | 34231422465 |
oct | 7476433346 |
9 | 2568010646 |
10 | 1023031014 |
11 | 485524385 |
12 | 24673ba06 |
13 | 133c420c5 |
14 | 99c249dc |
15 | 5ec30479 |
hex | 3cfa36e6 |
1023031014 has 8 divisors (see below), whose sum is σ = 2046062040. Its totient is φ = 341010336.
The previous prime is 1023031013. The next prime is 1023031021. The reversal of 1023031014 is 4101303201.
It is a sphenic number, since it is the product of 3 distinct primes.
1023031014 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 1023030984 and 1023031002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1023031013) 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, 85252579 + ... + 85252590.
It is an arithmetic number, because the mean of its divisors is an integer number (255757755).
Almost surely, 21023031014 is an apocalyptic number.
1023031014 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1023031014 is a wasteful number, since it uses less digits than its factorization.
1023031014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170505174.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 1023031014 is about 31984.8560103059. The cubic root of 1023031014 is about 1007.6188109715.
Adding to 1023031014 its reverse (4101303201), we get a palindrome (5124334215).
The spelling of 1023031014 in words is "one billion, twenty-three million, thirty-one thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •