Base | Representation |
---|---|
bin | 10010111111011010001… |
… | …001110101100001111010 |
3 | 11121202112010210011010122 |
4 | 102333122021311201322 |
5 | 132340202441233310 |
6 | 2435305211213242 |
7 | 163166662225121 |
oct | 22773211654172 |
9 | 4552463704118 |
10 | 1305035102330 |
11 | 46350a325093 |
12 | 190b11747222 |
13 | 960ab2c652b |
14 | 47242186ab8 |
15 | 23e30eb2555 |
hex | 12fda27587a |
1305035102330 has 32 divisors (see below), whose sum is σ = 2355927372288. Its totient is φ = 520490880000.
The previous prime is 1305035102251. The next prime is 1305035102333. The reversal of 1305035102330 is 332015305031.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1305035102330.
It is not an unprimeable number, because it can be changed into a prime (1305035102333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4601114 + ... + 4876506.
It is an arithmetic number, because the mean of its divisors is an integer number (73622730384).
Almost surely, 21305035102330 is an apocalyptic number.
1305035102330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1305035102330 is a deficient number, since it is larger than the sum of its proper divisors (1050892269958).
1305035102330 is a wasteful number, since it uses less digits than its factorization.
1305035102330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276782.
The product of its (nonzero) digits is 4050, while the sum is 26.
The spelling of 1305035102330 in words is "one trillion, three hundred five billion, thirty-five million, one hundred two thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •