Base | Representation |
---|---|
bin | 100101100001110010110110… |
… | …1000000110100101100010001 |
3 | 1121021210021010122122202012010 |
4 | 1023003211231000310230101 |
5 | 321231330031340313131 |
6 | 3130021523441253133 |
7 | 126346642646425620 |
oct | 11303455500645421 |
9 | 1537707118582163 |
10 | 330100130401041 |
11 | 961a8751a11930 |
12 | 310337499341a9 |
13 | 1122640237c980 |
14 | 5b72d082a96b7 |
15 | 28269de02eb46 |
hex | 12c396d034b11 |
330100130401041 has 128 divisors (see below), whose sum is σ = 658642276454400. Its totient is φ = 141137629839360.
The previous prime is 330100130400959. The next prime is 330100130401043. The reversal of 330100130401041 is 140104031001033.
It is not a de Polignac number, because 330100130401041 - 27 = 330100130400913 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 330100130400999 and 330100130401017.
It is not an unprimeable number, because it can be changed into a prime (330100130401043) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 169190176 + ... + 171130113.
It is an arithmetic number, because the mean of its divisors is an integer number (5145642784800).
Almost surely, 2330100130401041 is an apocalyptic number.
It is an amenable number.
330100130401041 is a deficient number, since it is larger than the sum of its proper divisors (328542146053359).
330100130401041 is a wasteful number, since it uses less digits than its factorization.
330100130401041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 340320359.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 330100130401041 its reverse (140104031001033), we get a palindrome (470204161402074).
The spelling of 330100130401041 in words is "three hundred thirty trillion, one hundred billion, one hundred thirty million, four hundred one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •