Base | Representation |
---|---|
bin | 1001011111110011101001… |
… | …0010100001010011110100 |
3 | 1100222020201221221011111011 |
4 | 2113330322102201103310 |
5 | 2332040301104231012 |
6 | 34113001501522004 |
7 | 2125261366453336 |
oct | 227747222412364 |
9 | 40866657834434 |
10 | 10442043430132 |
11 | 336649a324796 |
12 | 12078a3273304 |
13 | 5a98accbb372 |
14 | 28157d021456 |
15 | 13194c9141a7 |
hex | 97f3a4a14f4 |
10442043430132 has 12 divisors (see below), whose sum is σ = 18903699313380. Its totient is φ = 5040986483456.
The previous prime is 10442043430123. The next prime is 10442043430151. The reversal of 10442043430132 is 23103434024401.
It can be written as a sum of positive squares in 2 ways, for example, as 5467020243556 + 4975023186576 = 2338166^2 + 2230476^2 .
It is a junction number, because it is equal to n+sod(n) for n = 10442043430094 and 10442043430103.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 45008807773 + ... + 45008808004.
It is an arithmetic number, because the mean of its divisors is an integer number (1575308276115).
Almost surely, 210442043430132 is an apocalyptic number.
It is an amenable number.
10442043430132 is a deficient number, since it is larger than the sum of its proper divisors (8461655883248).
10442043430132 is a wasteful number, since it uses less digits than its factorization.
10442043430132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90017615810 (or 90017615808 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 10442043430132 its reverse (23103434024401), we get a palindrome (33545477454533).
The spelling of 10442043430132 in words is "ten trillion, four hundred forty-two billion, forty-three million, four hundred thirty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •