Base | Representation |
---|---|
bin | 10111000001010011001110… |
… | …111001010100010001001001 |
3 | 111021110212121010011101101221 |
4 | 113001103032321110101021 |
5 | 101232242103144424113 |
6 | 555155015335442041 |
7 | 30216445416453016 |
oct | 2701231671242111 |
9 | 437425533141357 |
10 | 101244440233033 |
11 | 2a294587090089 |
12 | b431a26226321 |
13 | 4465404691b16 |
14 | 1b003854d670d |
15 | ba8900bc698d |
hex | 5c14cee54449 |
101244440233033 has 32 divisors (see below), whose sum is σ = 108891677907200. Its totient is φ = 93845744640000.
The previous prime is 101244440233003. The next prime is 101244440233037. The reversal of 101244440233033 is 330332044442101.
It is a cyclic number.
It is not a de Polignac number, because 101244440233033 - 221 = 101244438135881 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101244440233033.
It is not an unprimeable number, because it can be changed into a prime (101244440233037) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4654691908 + ... + 4654713658.
It is an arithmetic number, because the mean of its divisors is an integer number (3402864934600).
Almost surely, 2101244440233033 is an apocalyptic number.
It is an amenable number.
101244440233033 is a deficient number, since it is larger than the sum of its proper divisors (7647237674167).
101244440233033 is a wasteful number, since it uses less digits than its factorization.
101244440233033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42833.
The product of its (nonzero) digits is 82944, while the sum is 34.
Adding to 101244440233033 its reverse (330332044442101), we get a palindrome (431576484675134).
The spelling of 101244440233033 in words is "one hundred one trillion, two hundred forty-four billion, four hundred forty million, two hundred thirty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •