Base | Representation |
---|---|
bin | 10111000011110011010110… |
… | …011000111010111110100011 |
3 | 111022002022100211021200212122 |
4 | 113003303112120322332203 |
5 | 101243101203322303103 |
6 | 555410011300414455 |
7 | 30235043026055315 |
oct | 2703632630727643 |
9 | 438068324250778 |
10 | 101416364650403 |
11 | 2a350490a20530 |
12 | b45b2073a742b |
13 | 44786a321b6ba |
14 | 1b088149917b5 |
15 | bad114454b38 |
hex | 5c3cd663afa3 |
101416364650403 has 8 divisors (see below), whose sum is σ = 111209277866736. Its totient is φ = 91718992051200.
The previous prime is 101416364650301. The next prime is 101416364650411. The reversal of 101416364650403 is 304056463614101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101416364650403 - 212 = 101416364646307 is a prime.
It is a super-3 number, since 3×1014163646504033 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101416364650453) 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, 23885152058 + ... + 23885156303.
It is an arithmetic number, because the mean of its divisors is an integer number (13901159733342).
Almost surely, 2101416364650403 is an apocalyptic number.
101416364650403 is a deficient number, since it is larger than the sum of its proper divisors (9792913216333).
101416364650403 is a wasteful number, since it uses less digits than its factorization.
101416364650403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47770308565.
The product of its (nonzero) digits is 622080, while the sum is 44.
The spelling of 101416364650403 in words is "one hundred one trillion, four hundred sixteen billion, three hundred sixty-four million, six hundred fifty thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •