Base | Representation |
---|---|
bin | 10010111100000001110… |
… | …010101001100110100110 |
3 | 11121102011011101020111110 |
4 | 102330001302221212212 |
5 | 132310234204124020 |
6 | 2433505100445450 |
7 | 163011014134461 |
oct | 22740162514646 |
9 | 4542134336443 |
10 | 1301405145510 |
11 | 461a17305878 |
12 | 190279b49886 |
13 | 95950257ca2 |
14 | 46dba03a2d8 |
15 | 23cbc4848e0 |
hex | 12f01ca99a6 |
1301405145510 has 16 divisors (see below), whose sum is σ = 3123372349296. Its totient is φ = 347041372128.
The previous prime is 1301405145503. The next prime is 1301405145577. The reversal of 1301405145510 is 155415041031.
It is a Harshad number since it is a multiple of its sum of digits (30), and also a Moran number because the ratio is a prime number: 43380171517 = 1301405145510 / (1 + 3 + 0 + 1 + 4 + 0 + 5 + 1 + 4 + 5 + 5 + 1 + 0).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21690085729 + ... + 21690085788.
It is an arithmetic number, because the mean of its divisors is an integer number (195210771831).
Almost surely, 21301405145510 is an apocalyptic number.
1301405145510 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1301405145510 is an abundant number, since it is smaller than the sum of its proper divisors (1821967203786).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1301405145510 is a wasteful number, since it uses less digits than its factorization.
1301405145510 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43380171527.
The product of its (nonzero) digits is 6000, while the sum is 30.
The spelling of 1301405145510 in words is "one trillion, three hundred one billion, four hundred five million, one hundred forty-five thousand, five hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •