Base | Representation |
---|---|
bin | 11101011001100011010… |
… | …00111000011011101011 |
3 | 10120120101002122200202010 |
4 | 32230301220320123223 |
5 | 113022241412140201 |
6 | 2052020114411003 |
7 | 132660314210130 |
oct | 16546150703353 |
9 | 3516332580663 |
10 | 1010150115051 |
11 | 35a447450630 |
12 | 143935290a63 |
13 | 743450c538c |
14 | 36c6a4c4587 |
15 | 1b4228c7bd6 |
hex | eb31a386eb |
1010150115051 has 64 divisors (see below), whose sum is σ = 1871566110720. Its totient is φ = 467891458560.
The previous prime is 1010150115047. The next prime is 1010150115059. The reversal of 1010150115051 is 1505110510101.
It is not a de Polignac number, because 1010150115051 - 22 = 1010150115047 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (1010150115059) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 6694651 + ... + 6843876.
It is an arithmetic number, because the mean of its divisors is an integer number (29243220480).
Almost surely, 21010150115051 is an apocalyptic number.
1010150115051 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1010150115051 is a deficient number, since it is larger than the sum of its proper divisors (861415995669).
1010150115051 is a wasteful number, since it uses less digits than its factorization.
1010150115051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13538584.
The product of its (nonzero) digits is 125, while the sum is 21.
Adding to 1010150115051 its reverse (1505110510101), we get a palindrome (2515260625152).
The spelling of 1010150115051 in words is "one trillion, ten billion, one hundred fifty million, one hundred fifteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •