Base | Representation |
---|---|
bin | 10110111101110011100110… |
… | …101011111011111010111000 |
3 | 111020121220210210212011120001 |
4 | 112331303212223323322320 |
5 | 101214323322212210130 |
6 | 554452424455442344 |
7 | 30163215144443263 |
oct | 2675634653737270 |
9 | 436556723764501 |
10 | 101004321210040 |
11 | 2a201768167136 |
12 | b3b33929863b4 |
13 | 44488887490b1 |
14 | 1ad28c7103cda |
15 | ba254a5a96ca |
hex | 5bdce6afbeb8 |
101004321210040 has 16 divisors (see below), whose sum is σ = 227259722722680. Its totient is φ = 40401728484000.
The previous prime is 101004321209923. The next prime is 101004321210049. The reversal of 101004321210040 is 40012123400101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101004321210049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1262554015086 + ... + 1262554015165.
Almost surely, 2101004321210040 is an apocalyptic number.
101004321210040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101004321210040 is an abundant number, since it is smaller than the sum of its proper divisors (126255401512640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101004321210040 is a wasteful number, since it uses less digits than its factorization.
101004321210040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2525108030262 (or 2525108030258 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 101004321210040 its reverse (40012123400101), we get a palindrome (141016444610141).
The spelling of 101004321210040 in words is "one hundred one trillion, four billion, three hundred twenty-one million, two hundred ten thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •