Base | Representation |
---|---|
bin | 11110010100001110011100… |
… | …110101011110010100001110 |
3 | 122111002100101121121211102002 |
4 | 132110032130311132110032 |
5 | 114434000001031030410 |
6 | 1151323315404232302 |
7 | 40040603635242656 |
oct | 3624163465362416 |
9 | 574070347554362 |
10 | 133331301033230 |
11 | 3953553a547803 |
12 | 12b545bab3b692 |
13 | 595211a9b6111 |
14 | 24cd3ab351366 |
15 | 10633be41b7a5 |
hex | 79439cd5e50e |
133331301033230 has 32 divisors (see below), whose sum is σ = 245851454596608. Its totient is φ = 52031400582400.
The previous prime is 133331301033197. The next prime is 133331301033233. The reversal of 133331301033230 is 32330103133331.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 133331301033193 and 133331301033202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133331301033233) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 70464920 + ... + 72332340.
It is an arithmetic number, because the mean of its divisors is an integer number (7682857956144).
Almost surely, 2133331301033230 is an apocalyptic number.
133331301033230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
133331301033230 is a deficient number, since it is larger than the sum of its proper divisors (112520153563378).
133331301033230 is a wasteful number, since it uses less digits than its factorization.
133331301033230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2041612.
The product of its (nonzero) digits is 13122, while the sum is 29.
Adding to 133331301033230 its reverse (32330103133331), we get a palindrome (165661404166561).
The spelling of 133331301033230 in words is "one hundred thirty-three trillion, three hundred thirty-one billion, three hundred one million, thirty-three thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •