Base | Representation |
---|---|
bin | 10111000011111000101110… |
… | …101001110010001001101010 |
3 | 111022002212021100102212002200 |
4 | 113003320232221302021222 |
5 | 101243200020422324002 |
6 | 555412404343441030 |
7 | 30235336121313534 |
oct | 2703705651621152 |
9 | 438085240385080 |
10 | 101422140433002 |
11 | 2a352985228484 |
12 | b460359756176 |
13 | 44790b3a0123c |
14 | 1b08c01ab6854 |
15 | bad35154cb1c |
hex | 5c3e2ea7226a |
101422140433002 has 24 divisors (see below), whose sum is σ = 219749017244484. Its totient is φ = 33807219174144.
The previous prime is 101422140433001. The next prime is 101422140433021. The reversal of 101422140433002 is 200334041224101.
101422140433002 is a `hidden beast` number, since 1 + 0 + 1 + 4 + 221 + 4 + 0 + 433 + 0 + 0 + 2 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 85650193958121 + 15771946474881 = 9254739^2 + 3971391^2 .
It is not an unprimeable number, because it can be changed into a prime (101422140433001) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9497863 + ... + 17118810.
Almost surely, 2101422140433002 is an apocalyptic number.
101422140433002 is an abundant number, since it is smaller than the sum of its proper divisors (118326876811482).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101422140433002 is a wasteful number, since it uses less digits than its factorization.
101422140433002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26828374 (or 26828371 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 101422140433002 its reverse (200334041224101), we get a palindrome (301756181657103).
The spelling of 101422140433002 in words is "one hundred one trillion, four hundred twenty-two billion, one hundred forty million, four hundred thirty-three thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •