Base | Representation |
---|---|
bin | 1001000001110101011… |
… | …11001110010010001000 |
3 | 1002122201222111110210201 |
4 | 10200322233032102020 |
5 | 20040314103244422 |
6 | 354303045421544 |
7 | 31261421603566 |
oct | 4407257162210 |
9 | 1078658443721 |
10 | 310223103112 |
11 | 10a623943a4a |
12 | 5015910a8b4 |
13 | 2333bb02050 |
14 | 1102cb7ca36 |
15 | 8109e3b727 |
hex | 483abce488 |
310223103112 has 16 divisors (see below), whose sum is σ = 626412035340. Its totient is φ = 143179893696.
The previous prime is 310223103103. The next prime is 310223103119. The reversal of 310223103112 is 211301322013.
It can be written as a sum of positive squares in 2 ways, for example, as 279728863236 + 30494239876 = 528894^2 + 174626^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 310223103112.
It is not an unprimeable number, because it can be changed into a prime (310223103119) by changing a digit.
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 in 3 ways as a sum of consecutive naturals, for example, 1491457123 + ... + 1491457330.
Almost surely, 2310223103112 is an apocalyptic number.
It is an amenable number.
310223103112 is an abundant number, since it is smaller than the sum of its proper divisors (316188932228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
310223103112 is a wasteful number, since it uses less digits than its factorization.
310223103112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2982914472 (or 2982914468 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 310223103112 its reverse (211301322013), we get a palindrome (521524425125).
The spelling of 310223103112 in words is "three hundred ten billion, two hundred twenty-three million, one hundred three thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •