Base | Representation |
---|---|
bin | 10111000100001110111110… |
… | …110100111111100011000011 |
3 | 111022012010221112122021102211 |
4 | 113010032332310333203003 |
5 | 101244042434214031133 |
6 | 555431355324322551 |
7 | 30240143203336234 |
oct | 2704167664774303 |
9 | 438163845567384 |
10 | 101446034127043 |
11 | 2a362026632461 |
12 | b464b076a3457 |
13 | 447b420c89738 |
14 | 1b0a02b15d08b |
15 | badc9e040bcd |
hex | 5c43bed3f8c3 |
101446034127043 has 8 divisors (see below), whose sum is σ = 107862876555840. Its totient is φ = 95079128215680.
The previous prime is 101446034127019. The next prime is 101446034127047. The reversal of 101446034127043 is 340721430644101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101446034127043 - 213 = 101446034118851 is a prime.
It is a super-2 number, since 2×1014460341270432 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101446034126987 and 101446034127005.
It is not an unprimeable number, because it can be changed into a prime (101446034127047) 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, 12484125168 + ... + 12484133293.
It is an arithmetic number, because the mean of its divisors is an integer number (13482859569480).
Almost surely, 2101446034127043 is an apocalyptic number.
101446034127043 is a deficient number, since it is larger than the sum of its proper divisors (6416842428797).
101446034127043 is a wasteful number, since it uses less digits than its factorization.
101446034127043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24968258717.
The product of its (nonzero) digits is 193536, while the sum is 40.
The spelling of 101446034127043 in words is "one hundred one trillion, four hundred forty-six billion, thirty-four million, one hundred twenty-seven thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •