Base | Representation |
---|---|
bin | 1001000101001110000… |
… | …11110000001100011111 |
3 | 1002211102122002221201000 |
4 | 10202213003300030133 |
5 | 20103024322033343 |
6 | 355203245121343 |
7 | 31354436562063 |
oct | 4424703601437 |
9 | 1084378087630 |
10 | 312040424223 |
11 | 110376759220 |
12 | 50585859253 |
13 | 2356b478098 |
14 | 11162283aa3 |
15 | 81b4766ed3 |
hex | 48a70f031f |
312040424223 has 64 divisors (see below), whose sum is σ = 519141772800. Its totient is φ = 183576430080.
The previous prime is 312040424203. The next prime is 312040424233. The reversal of 312040424223 is 322424040213.
312040424223 is a `hidden beast` number, since 3 + 12 + 0 + 4 + 0 + 424 + 223 = 666.
It is not a de Polignac number, because 312040424223 - 26 = 312040424159 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (312040424203) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4725448 + ... + 4791026.
It is an arithmetic number, because the mean of its divisors is an integer number (8111590200).
Almost surely, 2312040424223 is an apocalyptic number.
312040424223 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
312040424223 is a deficient number, since it is larger than the sum of its proper divisors (207101348577).
312040424223 is a wasteful number, since it uses less digits than its factorization.
312040424223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66069 (or 66063 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 27.
Adding to 312040424223 its reverse (322424040213), we get a palindrome (634464464436).
The spelling of 312040424223 in words is "three hundred twelve billion, forty million, four hundred twenty-four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •