Search a number
-
+
9100101000000 = 263565951413
BaseRepresentation
bin1000010001101100100001…
…0010011001101101000000
31012012221221200111111112210
42010123020102121231000
52143044001324000000
631204310110222120
71626313662142353
oct204331022315500
935187850444483
109100101000000
112999370858aaa
12102b7b14b4940
1351019c5a313a
1423663931829a
1510baab717350
hex846c8499b40

9100101000000 has 392 divisors, whose sum is σ = 30607005100320. Its totient is φ = 2385516800000.

The previous prime is 9100100999987. The next prime is 9100101000017. The reversal of 9100101000000 is 1010019.

It is a Harshad number since it is a multiple of its sum of digits (12).

It is a self number, because there is not a number n which added to its sum of digits gives 9100101000000.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 176974294 + ... + 177025706.

Almost surely, 29100101000000 is an apocalyptic number.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 9100101000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15303502550160).

9100101000000 is an abundant number, since it is smaller than the sum of its proper divisors (21506904100320).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

9100101000000 is an frugal number, since it uses more digits than its factorization.

9100101000000 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 51517 (or 51482 counting only the distinct ones).

The product of its (nonzero) digits is 9, while the sum is 12.

Adding to 9100101000000 its reverse (1010019), we get a palindrome (9100102010019).

The spelling of 9100101000000 in words is "nine trillion, one hundred billion, one hundred one million", and thus it is an aban number.