Base | Representation |
---|---|
bin | 10111011110001100011100… |
… | …000110000010001000111000 |
3 | 111112111200200220112211201010 |
4 | 113132030130012002020320 |
5 | 102012310030114144112 |
6 | 1003315113445153520 |
7 | 30513056613543234 |
oct | 2736143406021070 |
9 | 445450626484633 |
10 | 103230010303032 |
11 | 2a98a668684988 |
12 | b6b28016bb8a0 |
13 | 457a718526872 |
14 | 1b6c5057575c4 |
15 | be03b1e4963c |
hex | 5de31c182238 |
103230010303032 has 32 divisors (see below), whose sum is σ = 264076770545280. Its totient is φ = 33609770796000.
The previous prime is 103230010302949. The next prime is 103230010303037. The reversal of 103230010303032 is 230303010032301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103230010303037) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 50014538844 + ... + 50014540907.
It is an arithmetic number, because the mean of its divisors is an integer number (8252399079540).
Almost surely, 2103230010303032 is an apocalyptic number.
103230010303032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
103230010303032 is an abundant number, since it is smaller than the sum of its proper divisors (160846760242248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103230010303032 is a wasteful number, since it uses less digits than its factorization.
103230010303032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100029079803 (or 100029079799 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 103230010303032 its reverse (230303010032301), we get a palindrome (333533020335333).
The spelling of 103230010303032 in words is "one hundred three trillion, two hundred thirty billion, ten million, three hundred three thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.166 sec. • engine limits •