Base | Representation |
---|---|
bin | 101111000011000011… |
… | …1101001111010100001 |
3 | 100122210021001101021012 |
4 | 1132012013221322201 |
5 | 3123404301321231 |
6 | 114225313510305 |
7 | 10204504146101 |
oct | 1360607517241 |
9 | 318707041235 |
10 | 101034401441 |
11 | 39937316226 |
12 | 176b8272395 |
13 | 96b1c030bc |
14 | 4c665a5201 |
15 | 2964e63e2b |
hex | 17861e9ea1 |
101034401441 has 8 divisors (see below), whose sum is σ = 101236060800. Its totient is φ = 100832798160.
The previous prime is 101034401371. The next prime is 101034401467. The reversal of 101034401441 is 144104430101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101034401441 is a prime.
It is a super-2 number, since 2×1010344014412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101034401141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6613670 + ... + 6628928.
It is an arithmetic number, because the mean of its divisors is an integer number (12654507600).
Almost surely, 2101034401441 is an apocalyptic number.
It is an amenable number.
101034401441 is a deficient number, since it is larger than the sum of its proper divisors (201659359).
101034401441 is a wasteful number, since it uses less digits than its factorization.
101034401441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28039.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 101034401441 its reverse (144104430101), we get a palindrome (245138831542).
The spelling of 101034401441 in words is "one hundred one billion, thirty-four million, four hundred one thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •