Base | Representation |
---|---|
bin | 11110010011110010100011… |
… | …110100010111001010001100 |
3 | 122110222111002111220000010020 |
4 | 132103302203310113022030 |
5 | 114433002132433124322 |
6 | 1151301444002542140 |
7 | 40035463542534420 |
oct | 3623624364271214 |
9 | 573874074800106 |
10 | 133301353411212 |
11 | 39523871929068 |
12 | 12b4a841667950 |
13 | 594c35742c90c |
14 | 24cbb69c5cb80 |
15 | 106271a1dc05c |
hex | 793ca3d1728c |
133301353411212 has 96 divisors (see below), whose sum is σ = 355700397717504. Its totient is φ = 38061448224000.
The previous prime is 133301353411211. The next prime is 133301353411241. The reversal of 133301353411212 is 212114353103331.
It is a super-2 number, since 2×1333013534112122 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (133301353411211) 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, 3089161837 + ... + 3089204987.
It is an arithmetic number, because the mean of its divisors is an integer number (3705212476224).
Almost surely, 2133301353411212 is an apocalyptic number.
133301353411212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
133301353411212 is an abundant number, since it is smaller than the sum of its proper divisors (222399044306292).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133301353411212 is a wasteful number, since it uses less digits than its factorization.
133301353411212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66119 (or 66117 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 33.
The spelling of 133301353411212 in words is "one hundred thirty-three trillion, three hundred one billion, three hundred fifty-three million, four hundred eleven thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •