Base | Representation |
---|---|
bin | 1001000001011101100… |
… | …11111001100000010100 |
3 | 1002122020000222021212022 |
4 | 10200232303321200110 |
5 | 20034411342032012 |
6 | 354231140512312 |
7 | 31253442016034 |
oct | 4405663714024 |
9 | 1078200867768 |
10 | 310023002132 |
11 | 10a5309a2138 |
12 | 501020ab698 |
13 | 23309510abc |
14 | 110103718c4 |
15 | 80e75b2472 |
hex | 482ecf9814 |
310023002132 has 6 divisors (see below), whose sum is σ = 542540253738. Its totient is φ = 155011501064.
The previous prime is 310023002123. The next prime is 310023002161. The reversal of 310023002132 is 231200320013.
It can be written as a sum of positive squares in only one way, i.e., 264109655056 + 45913347076 = 513916^2 + 214274^2 .
It is a super-2 number, since 2×3100230021322 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 310023002132.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 38752875263 + ... + 38752875270.
It is an arithmetic number, because the mean of its divisors is an integer number (90423375623).
Almost surely, 2310023002132 is an apocalyptic number.
It is an amenable number.
310023002132 is a deficient number, since it is larger than the sum of its proper divisors (232517251606).
310023002132 is a wasteful number, since it uses less digits than its factorization.
310023002132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77505750537 (or 77505750535 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 310023002132 its reverse (231200320013), we get a palindrome (541223322145).
The spelling of 310023002132 in words is "three hundred ten billion, twenty-three million, two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •