Base | Representation |
---|---|
bin | 101111000000001100001… |
… | …100111101100011001111 |
3 | 102102210020122201121220002 |
4 | 233000030030331203033 |
5 | 410410040123143043 |
6 | 10511503433114515 |
7 | 452234624053010 |
oct | 57001414754317 |
9 | 12383218647802 |
10 | 3230020131023 |
11 | 1035931180714 |
12 | 441bbb258a3b |
13 | 1a57884420ca |
14 | b2495d83007 |
15 | 5904846bbb8 |
hex | 2f00c33d8cf |
3230020131023 has 16 divisors (see below), whose sum is σ = 3800770334784. Its totient is φ = 2686976582400.
The previous prime is 3230020131001. The next prime is 3230020131049. The reversal of 3230020131023 is 3201310200323.
3230020131023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 3230020131023 - 26 = 3230020130959 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3230020130986 and 3230020131004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3230020131623) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15603878 + ... + 15809523.
It is an arithmetic number, because the mean of its divisors is an integer number (237548145924).
Almost surely, 23230020131023 is an apocalyptic number.
3230020131023 is a deficient number, since it is larger than the sum of its proper divisors (570750203761).
3230020131023 is a wasteful number, since it uses less digits than its factorization.
3230020131023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31413842.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 3230020131023 its reverse (3201310200323), we get a palindrome (6431330331346).
The spelling of 3230020131023 in words is "three trillion, two hundred thirty billion, twenty million, one hundred thirty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •