Base | Representation |
---|---|
bin | 1001000001011110101… |
… | …10011001011111100101 |
3 | 1002122020122222202210100 |
4 | 10200233112121133211 |
5 | 20034421200433203 |
6 | 354232102414313 |
7 | 31253611624122 |
oct | 4405726313745 |
9 | 1078218882710 |
10 | 310032046053 |
11 | 10a536009a54 |
12 | 50105131399 |
13 | 2330b359432 |
14 | 11011647749 |
15 | 80e829bea3 |
hex | 482f5997e5 |
310032046053 has 6 divisors (see below), whose sum is σ = 447824066534. Its totient is φ = 206688030696.
The previous prime is 310032046031. The next prime is 310032046087. The reversal of 310032046053 is 350640230013.
It is a happy number.
310032046053 is a `hidden beast` number, since 31 + 0 + 0 + 3 + 20 + 4 + 605 + 3 = 666.
It can be written as a sum of positive squares in only one way, i.e., 259577003169 + 50455042884 = 509487^2 + 224622^2 .
It is not a de Polignac number, because 310032046053 - 25 = 310032046021 is a prime.
It is a super-2 number, since 2×3100320460532 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (310032046453) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 17224002550 + ... + 17224002567.
Almost surely, 2310032046053 is an apocalyptic number.
It is an amenable number.
310032046053 is a deficient number, since it is larger than the sum of its proper divisors (137792020481).
310032046053 is a wasteful number, since it uses less digits than its factorization.
310032046053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34448005123 (or 34448005120 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 27.
Adding to 310032046053 its reverse (350640230013), we get a palindrome (660672276066).
The spelling of 310032046053 in words is "three hundred ten billion, thirty-two million, forty-six thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •