Base | Representation |
---|---|
bin | 10111000010001000111011… |
… | …110111011001010111011011 |
3 | 111021200101102201212112000020 |
4 | 113002020323313121113123 |
5 | 101234213201333133034 |
6 | 555241313233241523 |
7 | 30223556356202355 |
oct | 2702107367312733 |
9 | 437611381775006 |
10 | 101302103021019 |
11 | 2a306a8724016a |
12 | b4410394032a3 |
13 | 446a993b48304 |
14 | 1b030957d20d5 |
15 | baa178157249 |
hex | 5c223bdd95db |
101302103021019 has 8 divisors (see below), whose sum is σ = 135094015414272. Its totient is φ = 67522462987560.
The previous prime is 101302103020967. The next prime is 101302103021029. The reversal of 101302103021019 is 910120301203101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101302103021019 - 28 = 101302103020763 is a prime.
It is a super-2 number, since 2×1013021030210192 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 101302103021019.
It is not an unprimeable number, because it can be changed into a prime (101302103021029) 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, 3068070687 + ... + 3068103704.
It is an arithmetic number, because the mean of its divisors is an integer number (16886751926784).
Almost surely, 2101302103021019 is an apocalyptic number.
101302103021019 is a deficient number, since it is larger than the sum of its proper divisors (33791912393253).
101302103021019 is an equidigital number, since it uses as much as digits as its factorization.
101302103021019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6136179897.
The product of its (nonzero) digits is 324, while the sum is 24.
The spelling of 101302103021019 in words is "one hundred one trillion, three hundred two billion, one hundred three million, twenty-one thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •