Base | Representation |
---|---|
bin | 10011001111011110000111… |
… | …11111011110110100011100 |
3 | 12112211002021111020202121201 |
4 | 21213233003333132310130 |
5 | 21021224021311000244 |
6 | 225554155014005244 |
7 | 11625004600315165 |
oct | 1147570377366434 |
9 | 175732244222551 |
10 | 42313011031324 |
11 | 125339356a1600 |
12 | 48b4665946824 |
13 | 1a7c13b3c2527 |
14 | a63d640a876c |
15 | 4d59d2788ad4 |
hex | 267bc3fded1c |
42313011031324 has 72 divisors (see below), whose sum is σ = 85677713475200. Its totient is φ = 18220359088800.
The previous prime is 42313011031307. The next prime is 42313011031349.
42313011031324 is nontrivially palindromic in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 42313011031292 and 42313011031301.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 483472729 + ... + 483560239.
Almost surely, 242313011031324 is an apocalyptic number.
42313011031324 is a gapful number since it is divisible by the number (44) formed by its first and last digit.
It is an amenable number.
42313011031324 is an abundant number, since it is smaller than the sum of its proper divisors (43364702443876).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42313011031324 is a wasteful number, since it uses less digits than its factorization.
42313011031324 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140135 (or 140122 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 28.
It can be divided in two parts, 4231301 and 1031324, that added together give a palindrome (5262625).
The spelling of 42313011031324 in words is "forty-two trillion, three hundred thirteen billion, eleven million, thirty-one thousand, three hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •