Base | Representation |
---|---|
bin | 1001000101010101011… |
… | …11100001100011001111 |
3 | 1002211120221102000121010 |
4 | 10202222233201203033 |
5 | 20103141132331343 |
6 | 355213333540303 |
7 | 31356120120360 |
oct | 4425257414317 |
9 | 1084527360533 |
10 | 312102230223 |
11 | 1103a8632a63 |
12 | 505a24a4693 |
13 | 2357b208094 |
14 | 1116a571b67 |
15 | 81b9dc4d33 |
hex | 48aabe18cf |
312102230223 has 16 divisors (see below), whose sum is σ = 503559901440. Its totient is φ = 167853300096.
The previous prime is 312102230221. The next prime is 312102230227. The reversal of 312102230223 is 322032201213.
It is a happy number.
It is not a de Polignac number, because 312102230223 - 21 = 312102230221 is a prime.
It is a super-2 number, since 2×3121022302232 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 312102230223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (312102230221) 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, 437117613 + ... + 437118326.
It is an arithmetic number, because the mean of its divisors is an integer number (31472493840).
Almost surely, 2312102230223 is an apocalyptic number.
312102230223 is a deficient number, since it is larger than the sum of its proper divisors (191457671217).
312102230223 is a wasteful number, since it uses less digits than its factorization.
312102230223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 874235966.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 312102230223 its reverse (322032201213), we get a palindrome (634134431436).
The spelling of 312102230223 in words is "three hundred twelve billion, one hundred two million, two hundred thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •