Base | Representation |
---|---|
bin | 100100101100100… |
… | …0010100110011111 |
3 | 10011210220120110121 |
4 | 1021121002212133 |
5 | 10010203113043 |
6 | 322103015411 |
7 | 42340612621 |
oct | 11131024637 |
9 | 3153816417 |
10 | 1231301023 |
11 | 582045757 |
12 | 2a443a567 |
13 | 1681336b4 |
14 | b975ac11 |
15 | 7316eded |
hex | 4964299f |
1231301023 has 8 divisors (see below), whose sum is σ = 1302689520. Its totient is φ = 1160570880.
The previous prime is 1231301017. The next prime is 1231301033. The reversal of 1231301023 is 3201031321.
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 1231301023 - 25 = 1231300991 is a prime.
It is a super-2 number, since 2×12313010232 = 3032204418481693058, 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 = 1231300988 and 1231301006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1231301003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 160738 + ... + 168223.
It is an arithmetic number, because the mean of its divisors is an integer number (162836190).
Almost surely, 21231301023 is an apocalyptic number.
1231301023 is a deficient number, since it is larger than the sum of its proper divisors (71388497).
1231301023 is a wasteful number, since it uses less digits than its factorization.
1231301023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 329177.
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 1231301023 is about 35089.8991591597. The cubic root of 1231301023 is about 1071.8189061506.
Adding to 1231301023 its reverse (3201031321), we get a palindrome (4432332344).
The spelling of 1231301023 in words is "one billion, two hundred thirty-one million, three hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •