Base | Representation |
---|---|
bin | 101100000111110010101… |
… | …011000010011101100110 |
3 | 101201212011220210002102020 |
4 | 230013302223002131212 |
5 | 344134040431442410 |
6 | 10240520422124010 |
7 | 432025235630313 |
oct | 54076253023546 |
9 | 11655156702366 |
10 | 3032023312230 |
11 | a6996812a180 |
12 | 40b762580606 |
13 | 18cbc3142273 |
14 | a6a71d47d0a |
15 | 53d0acd7a70 |
hex | 2c1f2ac2766 |
3032023312230 has 64 divisors (see below), whose sum is σ = 8008639630848. Its totient is φ = 728531202560.
The previous prime is 3032023312217. The next prime is 3032023312247. The reversal of 3032023312230 is 322133202303.
3032023312230 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 3032023312230.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 40617354 + ... + 40691933.
It is an arithmetic number, because the mean of its divisors is an integer number (125134994232).
Almost surely, 23032023312230 is an apocalyptic number.
3032023312230 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
3032023312230 is an abundant number, since it is smaller than the sum of its proper divisors (4976616318618).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3032023312230 is a wasteful number, since it uses less digits than its factorization.
3032023312230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81309421.
The product of its (nonzero) digits is 3888, while the sum is 24.
Adding to 3032023312230 its reverse (322133202303), we get a palindrome (3354156514533).
The spelling of 3032023312230 in words is "three trillion, thirty-two billion, twenty-three million, three hundred twelve thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •