Base | Representation |
---|---|
bin | 1001001110010111111100… |
… | …1111000100011001011111 |
3 | 1022220121200220210122101121 |
4 | 2103211333033010121133 |
5 | 2312133421411124323 |
6 | 33323231350351411 |
7 | 2064526622201650 |
oct | 223457717043137 |
9 | 38817626718347 |
10 | 10142552442463 |
11 | 326048348aa41 |
12 | 117984035b567 |
13 | 58759177b9ac |
14 | 270c8b73d527 |
15 | 128c6ec9da5d |
hex | 9397f3c465f |
10142552442463 has 8 divisors (see below), whose sum is σ = 11650328550432. Its totient is φ = 8649486345696.
The previous prime is 10142552442433. The next prime is 10142552442469. The reversal of 10142552442463 is 36424425524101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10142552442463 - 221 = 10142550345311 is a prime.
It is a super-2 number, since 2×101425524424632 (a number of 27 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 (10142552442469) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3677501320 + ... + 3677504077.
It is an arithmetic number, because the mean of its divisors is an integer number (1456291068804).
Almost surely, 210142552442463 is an apocalyptic number.
10142552442463 is a deficient number, since it is larger than the sum of its proper divisors (1507776107969).
10142552442463 is an equidigital number, since it uses as much as digits as its factorization.
10142552442463 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7355005601.
The product of its (nonzero) digits is 921600, while the sum is 43.
Adding to 10142552442463 its reverse (36424425524101), we get a palindrome (46566977966564).
The spelling of 10142552442463 in words is "ten trillion, one hundred forty-two billion, five hundred fifty-two million, four hundred forty-two thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.233 sec. • engine limits •